using namespace std;  

const int MAXN = 10005;  

int main() {  
    int n, m, r, c;  
    
    cin >> n >> m;  
   
    cin >> r >> c;  

    int dx[4] = {0, +1, 0, -1}; 
    int dy[4] = {+1, 0, -1, 0};  
    int a[MAXN][MAXN] = {0}; 

    
    int num = 1;  
    a[r][c] = num;  

    int x = r, y = c;  
    int cnt = 1; 

    while (num < n * m) {  
        for (int k = 0; k < 4; k++) {  
            int len = (cnt - 1) / 2 + 1;
            for (int l = 1; l <= len; l++) {  
                
                x += dx[k];  
                y += dy[k];  

               
                if (x >= 1 && x <= n && y >= 1 && y <= m) {  
                    ++num;  
                    a[x][y] = num; 
                }  
            }  
            ++cnt; 
        }  
    }  

   
    
    for (int i = 1; i <= n; i++) {  
        for (int j = 1; j <= m; j++) {  
            cout << a[i][j] ; 
        }  
        cout << endl;  
    }  

    return 0;  
}