# https://github.com/tyuyu-62/cp-library
from collections import deque, defaultdict
from itertools import permutations, product
from bisect import bisect_left, bisect_right
from heapq import heappush, heappop
from random import randint, shuffle
from time import perf_counter as pc
def II(): return int(input())
def LI(dec=0): return [int(x) - dec for x in input().split()]
def SI(): return input()
def LS(): return list(input().split())
mod = 998244353
inf = 2002002002002002002

import sys
sys.setrecursionlimit(10 ** 6)
input = lambda: sys.stdin.readline().rstrip()
_buf = []
def print(*args, sep=" "): _buf.append(sep.join(map(str, args)))
def debug(*args):
    if DEBUG: sys.stdout.write(" ".join(map(str, args)) + "\n")
DEBUG = True


def solve():
    N, K = LI()
    S = LI(1)
    T = LI(1)
    dist = abs(S[0] - T[0]) + abs(S[1] - T[1])
    if K < dist or (K - dist) % 2 == 1 or (dist + dist // 2 * 2 < K):
        print(-1)
    else:
        A = [["." for _ in range(N)] for _ in range(N)]
        d = (K - dist) // 2 * 2
        for i in range(N):
            for j in range(N):
                c = abs(S[0] - i) + abs(S[1] - j)
                if c & 1 and c < d:
                    A[i][j] = "#"
            print("".join(A[i]))
    return

if __name__ == "__main__":
    T = 1
    # T = II()
    for _ in range(T):
        solve()
    sys.stdout.write("\n".join(_buf) + "\n")