Problem:
 Score : 200 points    Problem Statement You are given a image with a height of H pixels and a width of W pixels.
Each pixel is represented by a lowercase English letter.
The pixel at the i -th row from the top and j -th column from the left is a_{ij} .  Put a box around this image and output the result. The box should consist of # and have a thickness of 1 .      Constraints  1 ≤ H, W ≤ 100  a_{ij} is a lowercase English letter.         Input Input is given from Standard Input in the following format:  H  W  a_{11}  ...  a_{1W}  :  a_{H1}  ...  a_{HW}       Output Print the image surrounded by a box that consists of # and has a thickness of 1 .        Sample Input 1 2 3
abc
arc      Sample Output 1 #####
#abc#
#arc#
#####       Sample Input 2 1 1
z      Sample Output 2 ###
#z#
###

Solution (Python):
N, W = map(int, input().split())
l = [input() for _ in range(N)]

print('
for i in l:
    print('
print('

Solution (Python):
h,w= map(int,input().split())
a = [input() for _ in range(h)]
s = ''
for i in range(w+2):
    s+='
print(s)
for i in a:
    t = list(i)
    t.insert(0,'
    t.append('
    print(''.join(t))
print(s)

Solution (Python):
H, W = map(int, input().split())

scr_list = [input() for _ in range(H)]

print('
for i in scr_list:
    print('
print('

Solution (Python):




def main():
    H, W = map(int, input().split())
    for i in range(W+2):
        print("
    print()
    for i in range(H):
        print("
        print(input(),end="")
        print("
    for i in range(W+2):
        print("
    print()


    
    pass

if __name__ == '__main__':
    main()

Solution (Python):
h, w = map(int,input().split())
a = [input() for _ in range(h)]
print("
for i in range(h):
    print("
print("

Solution (Python):
h,w = map(int,input().split())
l=[]
[l.append(input()) for _ in range(h)]

print("
for s in l:
    print("

print("

Solution (Python):
h,w = map(int, input().split())
print("
for i in range(h):
  s = input()
  print("
  
print("

Solution (Python):
from typing import List


def answer(h: int, w: int, a: List[str]) -> List[str]:
    top_bottom_line = '

    result = [top_bottom_line]
    for line in a:
        result.append(f'
    result.append(top_bottom_line)

    return result


def main():
    h, w = map(int, input().split())
    a = [input() for _ in range(h)]
    for i in answer(h, w, a):
        print(i)


if __name__ == '__main__':
    main()

Solution (Python):
h,w=map(int,input().split())
s=[""]*h
for i in range(h) :
  s[i]=input()
print("
for i in range(h) :
  print("
print("

Solution (Python):


H,W = map(int, input().split())
pic = []
for _ in range(H):
    a = input()
    pic.append(a)
print('
for i in range(H):
    print('
print('

Solution (Python):
h, w = map(int, input().split())

print("

for i in range(h):
  s = input()
  print("

print("

Solution (Python):
h,w=map(int,input().split())
huta=['
huta=''.join(huta)
print(huta)
for _ in range(h):
    a=input()
    print('
print(huta)

Solution (Python):
h,w=map(int,input().split())
print('
for i in range(h):    
    print('
print('

Solution (Python):
h,w = map(int,input().split())
a = []
for _ in range(h):a.append(input())
for _ in range(w + 2):print("
print()
for i in range(h):
    print("
    print(a[i],end="")
    print("
for _ in range(w + 2):print("

Solution (Python):
def main():
    h,w= map(int, input().split())
    a = []
    for i in range(h):
        a.append(input())
    cnt = len(a[0])+2
    print("
    for _ in a:
        print(f'
    print("


if __name__ == '__main__':
    main()

Solution (Python):
H, W = map(int, input().split())
L = ['
L = ['
[print(i) for i in L]

Solution (Python):
h,w = map(int,input().split())
print("
for i in range(h):
  print("
print("

Solution (Python):
H, W = [int(x) for x in input().split()]
pic = [list(input()) for _ in range(H)]
ans = [['
for i in range(H):
  for j in range(W):
    ans[i+1][j+1] = pic[i][j]
low = ''
for i in range(H+2):
  for j in range(W+2):
    low += ans[i][j]
  print(low)
  low = ''

Solution (Python):


h, w = map(int, input().split())

row = '

print(row)
for _ in range(h):
    print('

print(row)

Solution (Python):
H,W = map(int,input().split())
a = ''
for i in range(W + 2):
  a += '
L = []
L.append(a)
for j in range(H):
  b = str(input())
  c = '
  L.append(c)
L.append(a)
for k in range(H + 2):
  print(L[k])

Solution (Python):
H, W = map(int, input().split())
s = '
data = []
data.append(s)
for i in range(H):
    data.append('
data.append(s)
   
for i in range(H + 2):
    print(data[i])

Solution (Python):
h, w = map(int, input().split())
a = ['
for i in range(h):
    a.append('
a += ['

for i in range(h + 2):
    print(a[i])

Solution (Python):
h,w=map(int,input().split())
S=[list(input()) for i in range(h)]
for i in range(h+2):
  for j in range(w+2):
    if i in [0,h+1] or j in [0,w+1]:
      print("
    else:
      print(S[i-1][j-1],end="")
  print("")

Solution (Python):
h,w = map(int,input().split())

print('
for i in range (h):
    print('
print('

Solution (Python):
HW = input().split()

H = int(HW[0])
W = int(HW[1])

lst = []

for i in range(H):
   lst.append('

print('

for s in lst:
   print(s)

print('

Solution (Python):

import sys
input=sys.stdin.readline

def main():
    strings=[]
    h,w = map(int,input().split())
    strings=[input().rstrip() for _ in range(h)]
    output=""

    for i in range(h+2):
        if i==0 or i==h+1:
            igeta="
            print("{}".format(igeta))
        else:
            output="
            print(output)

if __name__=="__main__":
    main()

Solution (Python):
x,y = map(int,input().split())
L = [list(input()) for _ in range(x)]
F = [['
for i in range(x):
  for j in range(y):
    F[i+1][j+1] = L[i][j]
for f in F:
  print(''.join(f))

Solution (Python):
h, w = map(int, input().split())
words = [0]*(h+2)
for i in range(1, h+1, 1):
    s = input()
    words[i] = s

for j in range(len(words)):
    if words[j] == 0:
        words[j] = '
    else:
        words[j] = '

for ans in words:
    print(ans)

Solution (Python):
h, w = map(int, input().split())
a = [input() for _ in range(h)]
for i in range(h+2):
    if i == 0 or i == h+1:
        print("
    else:
        print("

Solution (Python):
H,W = map(int,input().split())
ls = [["

for _ in range(H):
  A = ["
  ls.append(A)
  
ls.append(["

for i in range(H+2):
  print("".join(ls[i]))

Solution (Python):
h, w = map(int, input().split())
a_l = [ ['

print(''.join(['
for a in a_l:
    print(''.join(a))
print(''.join(['

Solution (Python):
H,W = map(int, input().split())
H += 2
W += 2
for i in range(H):
	if i == 0 or i == H-1:
		out = '
	else:
		a = input()
		out = '
	print(out)

Solution (Python):
h, w = map(int, input().split())
pixel = [[] for i in range(h+2)]
for i in range(h+2):
    if i == 0:
        pixel[i].append('
    elif i == h+1:
        pixel[i].append('
    else :
        pixel[i].append('
        s = input()
        pixel[i].append(s)
        pixel[i].append('
for i in range(h+2):
    print("".join(pixel[i]))

Solution (Python):

def main():
    h, w = map(int, input().split())

    for i in range(h):
        a = input()

        if i == 0:
            print(('
            print('
        else:
            print('
    else:
        print(('


if __name__ ==  "__main__":
    main()

Solution (Python):
import sys
import copy
import math
import itertools
import numpy as np
l = [int(c) for c in input().split()]
H = l[0]
W = l[1]
a = [input() for c in range(H)]


print("
for i in range(H):
    print("
print("

Solution (Python):
H,W=map(int,input().split())
a=[input() for _ in range(H)]
for i in range(0,H):
    a[i]='

print('
for i in range(H):
    print(a[i])
print('

Solution (Python):
h,w = list(map(int, input().split()))
print('
for _ in range(h):
    print('
print('

Solution (Python):
H, W = map(int, input().split())
print("
for i in range(H):
  s = input()
  print("
print("

Solution (Python):
a,b=map(int,input().split())
s=[]
for i in range(a):
    s.append(input())
print("
for i in range(a):
    print("
    print(s[i],end="")
    print("
print("

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

h, w = map(int, input().split())
print('
for i in range(h):
    print('
print('

Solution (Python):
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext

def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    h, w = i_map()
    str_list = s_row_str(h)

    for i in range(h+2):
        if i == 0 or i == h+1:
            print('
            continue
        print('
        print(*str_list[i-1],end='')
        print('

if __name__ == '__main__':
    main()

Solution (Python):
with open(0) as f:
    H, W, *a = f.read().split()
W = int(W)
a.insert(0,'
a.append('
for x in a:
    print('

Solution (Python):
with open(0) as f:
    H, W, *a = f.read().split()
W = int(W)
a.insert(0,'
a.append('
for x in a:
    print('

Solution (Python):
h, w = map(int, input().split())
a = [[]]
print("
for _ in range(h):
    print("
print("

Solution (Python):
def main():
    h, w = map(int, input().split())
    a_list = [input() for _ in range(h)]

    print("
    for a in a_list:
        print("
    print("


if __name__ == "__main__":
    main()

Solution (Python):
h,w = map(int,input().split())
a = ["
for i in range(h):
    a.append('
a.append("
for i in range(h+2):
    print(a[i])

Solution (Python):
h,w = map(int,input().split())
a = ["
for i in range(h):
    a.append('
a.append("
for i in range(h+2):
    print(a[i])

Solution (Python):
with open(0) as f:
    H, W, *a = f.read().split()
W = int(W)
a.insert(0,'
a.append('
for x in a:
    print('

Solution (Python):
h, w = map(int, input().split())
print("
for i in range(h):
    s=input()
    print("
print("

Solution (Python):
H, W = map(int, input().split())
res = []

for i in range(H+2):
    if i == 0 or i == H+1:
        l = '
        res.append(l)
    else:
        a = input()
        a = '
        res.append(a)

for i in res:
    print(i)

Solution (Python):
H, W = map(int, input().split())


frame = [['

mat = [['
for i in range(H):
    line = input()
    for j in range(W):
        mat[i][j] = line[j]

for i, row in enumerate(mat):
    for j, char in enumerate(row):
        frame[i+1][j+1] = char

for i in frame:
    for j in i:
        print(j, end="")
    print()

Solution (Python):
H, W = map(int, input().split())
print("
for i in range(H):
  print("
print("

Solution (Python):
h,w = map(int, input().split())
a = [input() for i in range(h)]

print("
for i in range(h):
    print("
print("

Solution (Python):
x,y=input().split()
x=int(x)
y=int(y)
a=[input() for i in range(x)]
c=""
for i in range(y+2):
  c=c+"
print(c)
for i in range(x):
  print("
print(c)

Solution (Python):
h,w = map(int, input().split())
print("
for i in range(h):
  s = input()
  print("
print("

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    H, W = map(int, readline().split())

    res = ["

    for _ in range(H):
        res += ["

    res += ["

    for row in res:
        print(row)


if __name__ == '__main__':
    main()

Solution (Python):
h, w = map(int, input().split())
a = [list(input()) for i in range(h)]

print("
for i in range(h):
    a[i] = ["
    print("".join(a[i]))
print("

Solution (Python):
h,w=map(int,input().split())
a=[list(input()) for i in range(h)]

d=[['
for i in range(h):
  for j in range(w):
    d[i+1][j+1]=a[i][j]
for i in range(h+2):
  print(*d[i],sep='')

Solution (Python):
h,w=map(int,input().split())
 
print("
 
for i in range(h):
  num=input()
  print("
  
print("

Solution (Python):
h,w=map(int,input().split())

print("

for i in range(h):
  num=input()
  print("
  
print("

Solution (Python):


height, width = map(int, input().split())

for i in range(width+2):
    print("
    
print("")

for j in range(height):
    print("
    str = input()
    print(str, end='')
    print("


for l in range(width+2):
    print("

Solution (Python):
H, W = map(int, input().split())
A = [list(input()) for _ in range(H)]


print("
for a in A:
    print("

print("

Solution (Python):
h, w = map(int, input().split())
print("
for i in range(h):
    a = str(input())
    a = "
    print(a)
print("

Solution (Python):
h,w = map(int, input().split())
print("
for i in range(h):
    s = input()
    print("
print("

Solution (Python):
h, w = map(int, input().split())

s = "

print(s)
for i in range(h):
    t = input()
    print("
    print(t, end="
print(s)

Solution (Python):
h,w = map(int, input().split())
a = list(list(input().split()) for _ in range(h))
print("
for i in range(h):
    print("
print("

Solution (Python):
h, w = map(int, input().split())
p = [input() for _ in range(h)]

print('
for s in p:
    print('
print('

Solution (Python):
h, w = map(int, input().split())

print('
for i in range(h):
    data = list(map(str, input().split()))
    data2 = ['
    print(''.join(data2))


print('

Solution (Python):
h, w = map(int,input().split())

print("
for i in range(h):
    print("
print("

Solution (Python):
def solve():
    H, W = [int(i) for i in input().split()]
    print("
    for _ in range(H):
        print(f"
    print("

if __name__ == "__main__":
    solve()

Solution (Python):
def resolve():
    '''
    code here
    '''
    H, W = [int(item) for item in input().split()]
    grid = [input() for _ in range(H)]
    
    print('
    for line in grid:
        print('
    print('

if __name__ == "__main__":
    resolve()

Solution (Python):
H, W = map(int, input().split())
print("
for i in range(H):
  a = input()
  print("
print("

Solution (Python):
h, w = map(int, input().split())

a = ['
for _ in range(h):
    a.append('
a.append('

for i in a:
    print(i)

Solution (Python):
h,w=map(int, input().split())

print("
for i in range(h):
    print("
print("

Solution (Python):
H,W=map(int,input().split())
lines = []
for _ in range(H):
    lines.append(input())

print('
for line in lines:
    print('
print('

Solution (Python):
h,w = map(int,input().split())
[print("
print()
for i in range(h):
    print("
[print("

Solution (Python):
h, w = map(int, input().split())
a = []
for _ in range(h):
    a.append(input())
print('
for i in range(h):
    print('
print('

Solution (Python):




def main():
    H, W = map(int, input().split())
    print("
    for _ in range(H):
        print("
    print("

def test():
    import doctest
    doctest.testmod()

if __name__ == '__main__':
    
    main()

Solution (Python):
n,m=map(int,input().split())
print(*['

Solution (Python):
n,m=map(int,input().split())
print(*['

Solution (Python):
h, w = map(int, input().split())
print("
for _ in range(h):
  print("
print("

Solution (Python):
h, w = map(int, input().split())
a = [list(input()) for _ in range(h)]
l = []
for i in range(h):
    a[i].insert(0,'
    a[i].insert(w+1,'

for j in range(h+2):
    if j == 0 or j == h+1:
        l.append('
    else:
        l.append(a[j-1])
        
for i in range(h+2):
    print(''.join(l[i]))

Solution (Python):
n,m=map(int,input().split())
l=[]
for i in range(n):
    l.append(input())
print('
for i in range(n):
    print('
print('

Solution (Python):
import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush

def main():
    h,w = map(int, input().split())
    A = [input() for _ in range(h)]

    print('
    for i in range(h):
        print('
    print('


if __name__ == '__main__':
    main()

Solution (Python):
H,W=map(int,input().split())
a=[]
for i in range(H):
    a.append(list(input()))
for i in range(len(a)):
    a[i]=['
b=[]
for i in range(W+2):
    b.append('
print(''.join(b))
for i in range(len(a)):
    print(''.join(a[i]))
print(''.join(b))

Solution (Python):
H, W = map(int, input().split())
a = [list(input()) for _ in range(H)]
ans = ""
for i in range(H+2):
  for j in range(W+2):
    if 1 <= i <= H and 1 <= j <= W:
      ans += a[i-1][j-1]
    else:
      ans += '
  ans += "\n"
print(ans)

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
def s(x): 
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

h,w = m()

data = [input()[:-1] for i in range(h)]

print("

for i in range(h):
    print("

print("

Solution (Python):
from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))

h,w=nii()

print('
for i in range(h):
  print('
print('

Solution (Python):
h, w = map(int, input().split())
print('
for _ in [0]*h:
    print('
print('

Solution (Python):
H,W=map(int,input().split())
a=["" for i in range(H)]
for i in range(H):
    a[i]=list(str(input()))

for s in range(-1,H+1):
    for t in range(-1,W+1):           
        if s==-1 or s==H:
            print("
            break
        else:
            if t==-1:
                print("
            elif t==W:
                print("
            else:
                print(a[s][t],end="")

Solution (Python):
h,w = map(int,input().split())
for i in range(w+1):
    print("
print("
for i in range(h):
    print("
for i in range(w+1):
    print("
print("

Solution (Python):
H, W = map(int, input().split())
A = [input() for _ in range(H)]

W += 2
f = '
print(f * W)
for a in A:
    print(f'
print(f * W)

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

h, w = LI()
a = ['
a = ['
for i in a:
    print(i)

Solution (Python):
h,w = map(int,input().split())
s = []
s.append("
for i in range(h):
    t = input()
    t = "
    s.append(t)
s.append("
for ss in s:
    print("".join(ss))

Solution (Python):
h,w=map(int,input().split())
top = "
top *=(w + 2)
print(top)
for i in range(h):
  tmp = input()
  print("
print(top)

Solution (Python):
H,W=map(int,input().split())
anslist = [["
for i in range(H):
    a=input()
    for j in range(W):
        anslist[i+1][j+1]=a[j]
for i in range(H+2):
    for j in range(W+2):
        print(anslist[i][j],end="")
    print()

Solution (Python):
H,W = map(int,input().split())

ans = []

top = ['

ans.append(top)

for i in range(H):
    t = list(input())
    t = ['
    ans.append(t)

ans.append(top)

for aa in ans:
    print(''.join(map(str,aa)))

Solution (Python):
H, W = map(int, input().split())
a = [input() for _ in range(H)]
print('
for i in range(H):
    print('
print('

Solution (Python):
import sys

H, W = map(int, sys.stdin.readline().split())
print("
for _ in range(H):
    s = sys.stdin.readline().strip()
    print("
print("

Solution (Python):
h, w = map(int, input().split())
a = [input() for _ in range(h)]
ans = ['

for i in range(h):
    ans.append('

ans.append('
for i in range(h+2):
    print(ans[i])

Solution (Python):
H, W = [int(x) for x in input().split()]

for i in range(H):
    if i == 0:
        print(''.join(['

    print('

print(''.join(['

Solution (Python):
h, w = map(int, input().split())
grid = [["

for i in range(h):
    grid[i + 1] = ["

for i in range(h + 2):
    print("".join(grid[i]))

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

h,w = inpl()
s = [input() for _ in range(h)]
res = []
for i in range(h+2):
    if i == 0 or i == h+1:
        res.append('
    else:
        res.append('
for x in res:
    print(x)

Solution (Python):
H,W = map(int,input().split())
x = ["
for _ in range(H):
    a = input().strip()
    a = "
    x.append(a)
x.append("
for i in range(H+2):
    print(x[i])

Solution (Python):
h,w = map(int, input().split())
al = []
for _ in range(h):
    row = input()
    row = '
    al.append(row)

top = '
print(top)
for a in al:
    print(a)
print(top)

Solution (Python):
H,W = map(int,input().split())
A = [input() for i in range(H)]
print('
for a in A:
    print('
print('

Solution (Python):
H,W = map (int, input ().split ())
print ('
for i in range (H):
  a = input ()
  print ('
print ('

Solution (Python):
H,W = map(int, input().split())

a = [list(input()) for _ in range(H)]

for i in a:
    i.insert(0,'
    i.append('
    
print('
for i in a:
    print(''.join(i))
print('

Solution (Python):

H, W = map(int, input().split())
a = ['
for i in range(H):
    a.append('
a.append('

for i in a:
    print(i)

Solution (Python):
y,x = map(int,input().split())
for i in range(x+1):
    print("
print("
for i in range(y):
    print("
for i in range(x+1):
    print("
print("

Solution (Python):
H,W = map(int, input().split())
print('
for i in range(H):
  A = input()
  print('
print('

Solution (Python):
H, W = list(map(int, input().split()))
A = [[[] for j in range(W)] for i in range(H)]
print("
for i in range(H):
  A[i] = input()
  print("
print("

Solution (Python):
H,W = (int(T) for T in input().split())
print('
for TH in range(0,H):
    print('
print('

Solution (Python):

def resolve():
    import sys
    input = sys.stdin.readline
    
    
    

    h, w = [int(x) for x in input().rstrip().split(" ")]

    print("".join(["

    for i in range(h):
        print("

    print("".join(["

if __name__ == "__main__":
    resolve()

Solution (Python):
H, W = map(int, input().split())
data = []
for i in range(H):
  data.append(input().split())
print("
for i in range(H):
  print("
  for j in data[i]:
    print(j, end='')
  print("
print("

Solution (Python):

H,W = map(int,input().split())
a = []
for _ in range(H):
    ai = list(map(str,input()))
    a.append(ai)

b = ['

for i in range(H):
    a[i].insert(0,'
    a[i].append('
print(''.join(b))
for j in a:
    print(''.join(j))
print(''.join(b))

Solution (Python):
h,w=map(int,input().split())
a=[input() for i in range(h)]
print("
for i in range(h):
    print("
print("

Solution (Python):
H, W = map(int,input().split())
pic = []
for i in range(H):
    pic.append(list(map(str, input().split())))

print("
for j in range(H):
    print("
print("

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    H, W = LI()
    a = [SS() for _ in range(H)]

    print('
    for i in a:
        print('
    print('

if __name__ == '__main__':
    resolve()

Solution (Python):
h, w = list(map(int, input().split()))
s = []
for i in range(h):
    s.append(input())
print("
for i in s:
    print("
print("

Solution (Python):
H,W = map(int,input().split())
print('
for i in range(H):
    pixel = input()
    print(f'
print('

Solution (Python):
h, w = map(int, input().split())
for i in range(h+2):
    if i == 0 or i == h+1:
        print("
    else:
        s = input()
        print("

Solution (Python):
from collections import deque
h,w = map(int,input().split())
s = "

print(s*(w+2))

for i in range(h):
    lst = deque(list(map(str,input().split())))
    lst.appendleft("
    lst.append("
    print("".join(lst))

print(s*(w+2))

Solution (Python):
h,w = map(int,input().split())
s = ''
for i in range(w+2):
    s += '
print(s)
for i in range(h):
    a = str(input())
    print('
print(s)

Solution (Python):
h, w = map(int, input().split())
s = [list(input()) for i in range(h)]
s = [["
s = [["
for i in range(h+2):
  print("".join(s[i]))

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

h, w = rm()
print('
for _ in range(h):
    print('
print('

Solution (Python):
h,w = map(int, input().split())
a = [str(input()) for i in range(h)]

for j in range(h+2):
    if j == 0 or j == h+1:
        print("
    else:
        print("

Solution (Python):
import math
H, W = map(int, input().split())
a = [input() for _ in range(H)]
print('
for i in range(H):
    print('
print('

Solution (Python):
H, W = map(int, input().split())
print('
for h in range(H):
  print('
print('

Solution (Python):
H, W = map(int, input().split())
print("
for s in range(H):
    print("
print("

Solution (Python):
H,W = map(int,input().split())
pic = []

for i in range(H):
    pic.append("

print("

for i in pic:
    print(i)

print("

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()


def main():
    H, W = map(int, input().split())
    A = ['
    for i in range(H + 2):
        print(A[i])


if __name__ == "__main__":
    main()

Solution (Python):
H, W = map(int, input().split())
for i in range(W + 2):
  print("
print("")
for i in range(H):
  print("
  print(input(), end="")
  print("
for i in range(W + 2):
  print("
print("")

Solution (Python):
H,W=map(int,input().split())
print('
for i in range(H):
  print('
print('

Solution (Python):
H, W = map(int, input().split())
a = [input() for _ in range(H)]

print("

for a in a:
    print("
print("

Solution (Python):
H,W = map(int, input().split())
a = '
print(a)
for i in range(H):
    re = input()
    print('
print(a)

Solution (Python):
H, W = list(map(lambda x: int(x), input().split(" ")))
A = []
A.append("
for i in range(H):
  A.append("
A.append("

print("\n".join(A))

Solution (Python):
h, w = map(int, input().split())
l = [list(map(str, input().split())) for i in range(h)]
l = [["
l = [["
for i in range(h+2):
    print("".join(l[i]))

Solution (Python):

H, W = map(int, input().split())
print("
for i in range(H):
    text = "
    text += input()
    text += "
    print(text)
print("

Solution (Python):
h,w=map(int,input().split())
l=[input() for _ in range(h)]
print('
for a in l:
    print('
print('

Solution (Python):
import sys


inint = lambda: int(sys.stdin.readline())
inintm = lambda: map(int, sys.stdin.readline().split())
inintl = lambda: list(inintm())
instrm = lambda: map(str, sys.stdin.readline().split())
instrl = lambda: list(instrm())

h, w = inintm()

pixel = []
f = ""
l = ""

for i in range(w+2):
    f += "

pixel.append(f)

for i in range(h):
    pixel.append("

for i in range(w+2):
    l += "

pixel.append(l)

for x in pixel:
    print(x)

Solution (Python):









h,w = map(int, input().split())
a = [list(input()) for _ in range(h)]

for i in range(h+2):
    for j in range(w+2):
        if (i == 0 or i == h+1):
            print("
        else:
            if (j == 0 or j == w+1):
                print("
            else:
                print(a[i-1][j-1], end="")
    print("")

Solution (Python):
h, w = map(int, input().split())
htop = '
grid = [htop]
for _ in range(h):
    grid.append('
else:
    grid.append(htop)
print(*grid, sep='\n')

Solution (Python):
h,w= list(map(int, input().strip().split()))
grid = []
for i in range(h):
    array = input().strip()
    grid.append(array)
print('
for i in range(h):
    print("
print('

Solution (Python):
H,W = map(int,input().split())
ansls = []
ansls.append('
for i in range(H):
    ansls.append('
ansls.append('
for i in range(H+2):
    print(ansls[i])

Solution (Python):
from sys import stdin

h,w = [int(x) for x in stdin.readline().strip().split()]
output = "

for _ in range(h):
  output += "\n"
  output += "
  
output += "\n" + "
print(output)

Solution (Python):
H,W = map(int,input().split())
S = [""]
for i in range(W + 2):
    S[0] += "
for i in range(H):
    S.append("

S.append("")
for i in range(W + 2):
    S[H  + 1] += "

for s in S:
    print(s)

Solution (Python):
h,w=map(int,input().split())
a=[[] for i in range(h)]
for i in range(h):
    a[i].append(input())
b=["
a.append(b)
a.insert(0,b)

for i in range(h):
    a[i+1].append("
    a[i+1].insert(0,"
    
for i in range(h+2):
    print("".join(a[i]))

Solution (Python):
H, W = map(int, input().split())
A = [input() for _ in range(H)]

t = ""
for i in range(W + 2):
    t += "
t += "\n"

res = ""

res += t

for a in A:
    res += "

res += t

print(res, end="")

Solution (Python):
h,w=map(int,input().split())
print("
for i in range(h):
  print("
print("

Solution (Python):
h, w = map(int, input().split())
mat = [["
pix = []
for i in range(h):
	s = input()
	pix.append(s)
for i in range(1, h+1):
	for j in range(1, w+1):
		mat[i][j] = pix[i-1][j-1]
for i in mat:
	print("".join(i))

Solution (Python):
h,w=map(int,input().split())
print("
for i in range(h):
    print("
print("

Solution (Python):
"""AtCoder."""


def main():
    h, w = map(int, input().split())
    print('
    for _ in range(h):
        print('
    print('

if __name__ == '__main__':
    main()

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')

H, W = map(int, input().split())

print("
for _ in range(H):
    line = "
    print(line)
print("