#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  int si, sj, ti, tj;
  cin >> si >> sj >> ti >> tj;
  si--, sj--, ti--, tj--;
  vector<string> s(n, string(n, '.'));
  int d = abs(ti - si) + abs(tj - sj);
  if (d > k || d % 2 != k % 2) {
    cout << -1 << '\n';
    return 0;
  }
  int draw = (k - d) / 2;
  // 1, 3, 5, ..., 2draw - 1
  if (2 * draw - 1 >= d) {
    cout << -1 << '\n';
    return -1;
  }
  rep(i, n) rep(j, n) {
    int d = abs(i - si) + abs(j - sj);
    if (d <= 2 * draw - 1 && d % 2) s[i][j] = '#';
  }
  rep(i, n) cout << s[i] << '\n';
}