#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, a, n) for(int i = a; i < n; i++)
#define rrep(i, a, n) for(int i = a; i >= n; i--)
#define inr(l, x, r) (l <= x && x < r)
#define ll long long
#define ld long double

// using mint = modint1000000007;
// using mint = modint998244353;
constexpr int IINF = 1001001001;
constexpr ll INF = 1e18;

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}


int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, k; cin >> n >> k;
    int sr, sc; cin >> sr >> sc; sr--, sc--;
    int tr, tc; cin >> tr >> tc; tr--, tc--;

    int d = abs(sr-tr)+abs(sc-tc);
    if(d == 1){
        if(k == 1){
            rep(i, 0, n){
                rep(j, 0, n){
                    cout << '.';
                }
                cout << endl;
            }
        }else{
            cout << -1 << endl;
        }
    }else if(d%2 == 1 && k%2 == 1 && inr(d, k, 2*d)){
        rep(i, 0, n){
            rep(j, 0, n){
                int dist = abs(sr-i)+abs(sc-j);
                if(dist%2 == 1 && dist <= (k-d)) cout << '#';
                else cout << '.';
            }
            cout << endl;
        }
    }else if(d%2 == 0 && k%2 == 0 && inr(d, k, 2*d+1)){
        rep(i, 0, n){
            rep(j, 0, n){
                int dist = abs(sr-i)+abs(sc-j);
                if(dist%2 == 1 && dist <= (k-d)) cout << '#';
                else cout << '.';
            }
            cout << endl;
        }
    }else{
        cout << -1 << endl;
    }
    
    return 0;
}