/** author: shobonvip created: 2026.09.19 17:00:48 **/ #include using namespace std; //* ATCODER #include using namespace atcoder; typedef modint998244353 mint; //*/ /* BOOST MULTIPRECISION #include using namespace boost::multiprecision; //*/ typedef long long ll; #define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++) #define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--) #define all(v) v.begin(), v.end() template bool chmin(T &a, const T &b) { if (a <= b) return false; a = b; return true; } template bool chmax(T &a, const T &b) { if (a >= b) return false; a = b; return true; } template T max(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]); return ret; } template T min(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]); return ret; } template T sum(vector &a){ T ret = 0; for (int i=0; i<(int)a.size(); i++) ret += a[i]; return ret; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n,k; cin >> n >> k; int sr,sc,tr,tc; cin >> sr>>sc>>tr>>tc; sr--;sc--;tr--;tc--; int must = abs(sr-tr)+abs(sc-tc); if (k < must) { cout<<-1<<'\n';return 0; } if (k%2!=must%2) { cout<<-1<<'\n';return 0; } bool mode=0; if (! (sr>=tr && sc>=tc)) { swap(sr,tr); swap(sc,tc); } if (! (sr>=tr && sc>=tc)) { mode = 1; sr = n-1-sr; tr = n-1-tr; } if (! (sr>=tr && sc>=tc)) { swap(sr,tr); swap(sc,tc); } vector>ans(n,vector(n,'.')); rep(i,tr+tc+1,sr+sc) { if(i%2!=(tr+tc+1)%2)continue; if (must=0&&y>=0&&x>nans(n,vector(n,'.')); rep(i,0,n){ rep(j,0,n){ nans[i][j]=ans[n-1-i][j]; } } swap(ans,nans); } rep(i,0,n){ rep(j,0,n){ cout<