#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

const int dx4[4] = { 1, 0, -1, 0 };
const int dy4[4] = { 0, -1, 0, 1 };
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, k; cin >> n >> k;
	int sx, sy, tx, ty;
	cin >> sx >> sy >> tx >> ty;
	sx--, sy--, tx--, ty--;
	vector a(n, vector<char>(n, '.'));
	rep(i, n)rep(j, n) {
		int x = (i + j) % 2;
		if (i == tx && j == ty)continue;
		int y = (sx + sy) % 2;
		if (x != y)a[i][j] = '#';
	}
	int mn = abs(tx - sx) + abs(ty - sy);
	if (k < mn) {
		cout << -1 << endl;
		return 0;
	}
	vector dp(n, vector<int>(n, INF));
	{
		using S = std::pair<int, P>;
		std::priority_queue<S, std::vector<S>, std::greater<S>> pq;

		dp[sx][sy] = 0;
		pq.push({ 0, { sx,sy } });
		while (!pq.empty()) {
			auto [d, xy] = pq.top();
			auto [x, y] = xy;
			pq.pop();
			if (dp[x][y] != d)continue;
			rep(i, 4) {
				int nx = x + dx4[i];
				int ny = y + dy4[i];
				if (nx < 0 || nx >= n)continue;
				if (ny < 0 || ny >= n)continue;
				int add = a[x][y] == a[nx][ny] ? 1 : 2;
				if (chmin(dp[nx][ny], dp[x][y] + add)) {
					pq.push({ dp[nx][ny], { nx,ny } });
				}
			}
		}
	}
	if (dp[tx][ty] < k) {
		cout << -1 << endl;
		return 0;
	}
	if (dp[tx][ty] % 2 != k % 2) {
		cout << -1 << endl;
		return 0;
	}
	int dx = dp[tx][ty] - k;
	int th = dp[tx][ty] - 2 * dx;
	rep(i, n)rep(j, n)if (dp[i][j] > th)a[i][j] = '.';
	rep(i, n) {
		rep(j, n)cout << a[i][j];
		cout << endl;
	}
	//cout << dp[tx][ty] << endl;
	return 0;
}