#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)
template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

void solve() {
	int n, k;
	cin >> n >> k;
	int sx, sy, tx, ty;
	cin >> sx >> sy >> tx >> ty;
	sx--, sy--, tx--, ty--;
	int d = abs(sx - tx) + abs(sy - ty);
	if (d > k || (k - d) % 2 != 0 || k - d > d / 2 * 2) {
		cout << "-1\n";
		return;
	}
	int nd = k - d;
	vector<vector<int>> ans(n, vector<int>(n, 0));
	rep(i, 0, n) rep(j, 0, n) {
		int t = abs(i - sx) + abs(j - sy);
		if (t < nd && t % 2) ans[i][j] = 1;
	}

	rep(i, 0, n) {
		rep(j, 0, n) cout << (ans[i][j] ? '#' : '.');
		cout << '\n';
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	int t = 1;
	// cin >> t;
	while (t--) solve();
}