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):
H, W = map(int, input().split())
A = ["
A.extend(["
A.append("
print("\n".join(A))

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


X = "




for i in range(H):
	A[i][0] = "

print(X)
for i in range(H):
	print(A[i][0])
print(X)

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

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

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    h, w = mi()
    grid = [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())
ans=[["
for i in range(h):
  temp=list(map(str,input()))
  temp.insert(0,"
  temp.append("
  ans.append(temp)
ans.append(["
for i in range(h+2):
  print("".join(ans[i]))

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())
A=["
for a in A:
    print(*a,sep="")

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

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

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

ikeg = '
print(ikeg)
for i in range(H):
    print('
print(ikeg)

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

print('
for j in a:
	print('
print('

Solution (Python):
H, W = map(int, input().split())
ans = [input() for _ in range(H)]
print("
[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())
print('
for i in range(h):
    s = input()
    print('
print('

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())
s =list()
for i in range(h):
    s.append(list(input()))

print("".join(["
for j in range(h):
    s[j].insert(0,"
    s[j].append("
    print("".join(s[j]))
print("".join(["

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

a =[]

for i in range(H):
    temp = str(input())
    a.append(temp)
    

cnt =0

for i in range(H+2):
    
    if i==0 or i==H+1:
        print("
    else:
        print("
        cnt+=1

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

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())
tb = ['
print(*tb, sep='')
for i in range(h):
	print('
print(*tb, sep='')

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

for i in range(H):
	a[i] = '
    
for i in range(H+2):
	if i == 0 or i == H+1:
		print('
	else:
		print(a[i-1])

Solution (Python):
import sys


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]


h, w = LI()
a = SR(h)

print('
for s in a:
    print('
print('

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

for i in range(h):
    print("

print("

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

a = []
b = [['


for i in range(h):
    a.append(list(input())) 

for j in range(h):
    for k in range(w):
        b[j+1][k+1] = a[j][k]
        

for l in range(h+2):
    print("".join(b[l]))

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

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

print('
for x in a:
    print(x)
print('

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

sh = '

print(sh * (w+2))
[print(sh + input() + sh) for i in range(h)]
print(sh * (w+2))

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

a1 = ["
x = [0]*h
for i in range(0,h):
  x[i] = input().split()

a1 = ''.join(a1)

print(a1)
for i in range(0,h):
  x[i] = ''.join(x[i])
  print("
print(a1)

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

print('
for i in range(0,h):
    print('
    print(input(),end='')
    print('
print('

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

Solution (Python):
h, w =map(int, input().split())
a = ['
for i in range(h):
    aa = '
    a.append(aa)
a.append('
print('\n'.join(a))

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

for i in range(H+2):
    if i == 0:
        a.insert(0, '
        print(a[i])
    elif i == H+1:
        a.append('
        print(a[i])
    else:
        a[i] = '
        print(a[i])

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

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

ans = ['

for index, word in enumerate(base_word):
    ans.append("

ans.append('

for i in range(H+2):
    print(ans[i])

Solution (Python):

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

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

w = "
h = []*H

for i in range(H):
    a = str("
    h.append(a)

print(w)
for j in h:
    print(j)
print(w)

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

Solution (Python):
h, w = list(map(int, input().split()))
A = [['
[print(''.join(a)) for a in A]

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)]

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

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

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

print("
for a in A:
    print("
print("

Solution (Python):






import sys
input = sys.stdin.readline

import math

import bisect
from collections import defaultdict
from collections import deque
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def Yes(): print("Yes"); return
def No(): print("No"); return


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1:
    arr.append([temp, 1])
  if arr==[]:
    arr.append([n, 1])
  return arr


def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors


def lcm(a, b):
    return a * b // gcd (a, b)


def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count


def Base_10_to_n(X, n):
  if X//n:
    return Base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def Base_n_to_10(X, n):
  return sum(int(str(X)[-i])*n**i for i in range(len(str(X))))


def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count





H,W = inputIL()

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

Solution (Python):
H, W = map(int, input().split())
ans  = ['
print(*ans, sep='\n')

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

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

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

print(header)

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

if __name__ == '__main__':
    main()

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

print(x)
for s in S:
    print(s)
print(x)

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

top = "
print(top)
for hw in hw_list:
    print("
    print(hw, end="")
    print("
print(top)

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

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

print(end)

Solution (Python):
def invr():
    return(map(int, input().split()))


def insr():
    s = input()
    return(list(s[:len(s)]))


strs = []
a, b = invr()

for i in range(a):
    s = input()
    strs.append(s)
print("
for s in strs:
    print("
print("

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

print(''.join(f))

for j in range(h):
    print('

print(''.join(f))

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

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

Solution (Python):
H, W = map(int, input().split())
picture = [input() for _ in range(H)]
print('
for row in picture:
    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):
N, M = map(int, input().split())
print("
for _ in range(N):
  print("
print("

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

Lists = []
Lists.append([sharp])
for i in range(H):
    Lists.append(["

Lists.append([sharp])

for List in Lists:
    print(*List)

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

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

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

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

s = '

print(s)

for _ in range(h):
    a = input()
    a = '
    print(a)

print(s)

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

Solution (Python):
from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

h,w = mi()
a = [input() for i in range(h)]

print("

for i in range(h):
    print("
    for j in range(w):
        print(a[i][j],end="")
    print("
print("

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

for h in range(H):
    for w in range(W):
        ans[h+1][w+1] = pic[h][w]
        
for i in range(H+2):
    for j in range(W+2):
        print(ans[i][j], end="")
    print()

Solution (Python):
from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

h,w = mi()
a = [input() for i in range(h)]

print("

for i in range(h):
    print("
    for j in range(w):
        print(a[i][j],end="")
    print("
print("

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

Solution (Python):
import sys

input = sys.stdin.readline

def main():
    ans = ''
    f = '
    n = '\n'
    H, W = map(int, input().split())
    ans += f*(W+2)
    for _ in range(H):
        ans += n + f + input().rstrip(n) + f
    ans += n + f*(W+2)
    print(ans)

if __name__ == '__main__':
    main()

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

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):
import math
import copy

neko = 0
nuko = 0
inu = 0

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

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

Solution (Python):
h,w = map(int,input().split())
p = [input() for i in range(h)]
f = "
ans = [f]
for pp in p:
	a = "
	ans.append(a)
ans.append(f)

for an in ans:
	print(an)

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

m = ["

for _ in range(H):
    m.append("

m.append("

for i in m:
    print(i)

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

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

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

li = ["

for _ in range(H):
    li.append("

li.append("

print(*li, sep="\n")

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

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

a = []

for i in range(h):
    a.append(list(input()))

for i in range(h):
    for j in range(w):
        b[i+1][j+1] = a[i][j]

for i in range(h + 2):
    for j in range(w + 2):
        print(b[i][j], end = "")
    print("")

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

wall = ""


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


for i in range(h):
    print("


print(wall)

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

a=[input() for i in range(h)]

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

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

Solution (Python):
def main():
    b, w = map(int, input().split())
    image = [list(input()) for _ in range(b)]
    image.insert(0, ["
    image.append(["
    for im in image:
        im.insert(0, "
        im.append("

    for im in image:
        print(*im, sep="")


if __name__ == "__main__":
    main()

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

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

Solution (Python):
H,W = map(int,input().split())
a = [list(map(str,input().split())) for _ in range(H)]
ans = []
bar = ['
ans.append(bar)

for i in range(len(a)):
    item = ['
    for j in range(len(a[i])):
        item.append(a[i][j])
    item.append('
    ans.append(item)
ans.append(bar)

for i in range(len(ans)):
    print(''.join(ans[i]))

Solution (Python):
h , w = map(int , input().split())
sharp = '
print(sharp)
for i in range(h):
  a = list(input())
  a.insert(0 , '
  a.append('
  print(''.join(a))
print(sharp)

Solution (Python):
h, w = map(int, input().split())
A = list(input().split() for _ 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)]

ans = []
ans.append("

for a in A:
  ans.append("
ans.append("

for i in ans:
  print(i)

Solution (Python):
H,W = list(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=list(input() for _ in range(h))
l='
print(l)
for i in a:
    print('
print(l)

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

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

return_list = []

for i,row in enumerate(a_list):
    if i == 0:
        return_list.append(['
    row.insert(0,'
    row.append('
    return_list.append(row)
    if i == len(a_list)-1:
        return_list.append(['

for elem in return_list:
    print(''.join(elem))

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

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

Solution (Python):
h,w = map(int,input().split())
a_list = [input() for nesya in range(h)]
print("
for hoge in a_list:
  print('
print("

Solution (Python):

import collections
import itertools as it
import math

 


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




 
print('{}'.format('
for _ in range(h):
    print('
print('{}'.format('

Solution (Python):


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

A = []
for i in range(H):
    A.append(input())

print('

for a in A:
    print('

print('

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

ls = "
print(ls)

for i in range(H):
    print("

print(ls)

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**6)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7

H, W = ri_()
a = ['
for _ in range(H):
    a.append('
a.append('
for i in range(H + 2):
    print(a[i])

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

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

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

a = [input() for _ in [0]*h]

for _ in [0]*(w+2):
  print('
print()
for i in range(h):
  print('
  print(a[i],end='')
  print('

for _ in [0]*(w+2):
  print('
print()

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

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

b_list = a_list.copy()

for i in range(h):
    sharp = ["
    sharp = "".join(sharp)
    if i == 0:
        b_list.insert(0, sharp)
    if i == h-1:
        b_list.append(sharp)
    
    replace = str('
    b_list[i+1] = replace

for i in range(len(b_list)):
    print(b_list[i])

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

Solution (Python):
import sys, heapq, bisect, math, fractions
from collections import deque

H, W = map(int, input().split())
A = [list(sys.stdin.readline().strip()) for _ in range(H)]

print("
for i in range(H):
    res = "".join(A[i])
    print("
    
print("

Solution (Python):
from sys import stdin
def main():
    
    readline=stdin.readline
    H,W=map(int,readline().split())
    a=["
    for i in range(H):
        s=readline().strip()
        s="
        a.append(s)
    a.append("
    
    for i in range(H+2):
        print(a[i])

if __name__=="__main__":
    main()

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

ans_map = [['
for i in range(h):
    s = input()
    ans_map.append(['
ans_map.append(['

for ans in ans_map:
    print(ans[0])

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

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

    
resolve()

Solution (Python):
import sys
input = sys.stdin.readline

h, w = [int(x) for x in input().split()]
a = [input().rstrip() for _ in range(h)]
print("
for i in a:
    print('
print("

Solution (Python):
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right


from functools import reduce
from pprint import pprint

INF = float("inf")

def myinput():
    return map(int,input().split())

def mylistinput(n):
    return [ list(myinput()) for _ in range(n) ]

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print(" ".join(ls))
        elif type(ls[0])==int:
            print(" ".join(map(str,ls)))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print("".join(ls))
        elif type(ls[0])==int:
            print("".join(map(str,ls)))
        else:
            print("Output Error")

h,w = myinput()
a = [ input() for _ in range(h) ]

b = ["
myoutput(b,False)
for i in range(h):
    c = "
    myoutput(c,False)
myoutput(b,False)

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

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

Solution (Python):
H,W=map(int, input().split())
ans=[['
for i in range(1,H+1):
    for j,a in enumerate(input()):
        j+=1
        ans[i][j]=a
for a in ans:
    print(''.join(a))

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

if __name__ == "__main__":
  resolve()

Solution (Python):
import numpy as np
import functools
import math
import collections
import scipy
import fractions
import itertools

def solve():
    h, w = map(int, input().split())
    hoge = []
    for i in range(h):
        hoge.append(input())
    print("
    for i in range(h):
        print("
    print("
    return 0

if __name__ == "__main__":
    solve()

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

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

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

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

ue = "
l = []
for i in range(H):
    x = input()
    x = "
    l.append(x)
    
print(ue)
for i in l:
    print(i)
print(ue)

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 9)
MOD = 10 ** 9 + 7

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

G = [['
for _ in range(H):
    G.append(['

G.append(['

for tmp in G:
    print (*tmp, sep = '')

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7

h,w=MI()
for i in range(w+2):
    print("
print("")
for i in range(h):
    print("
    print(input().rstrip(),end="")
    print("
for i in range(w+2):
    print("

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

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

ans = [""] * (h+2)
ans[0] = "
ans[-1] = "
for i in range(h):
  ans[i+1] = "
for v in ans: print(v)

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

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

if __name__ == '__main__':
    main()

Solution (Python):
from statistics import median


from fractions import gcd
from itertools import combinations 
from collections import deque
from collections import defaultdict
import bisect










import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))

def main():
    h,w = readInts()
    maze = [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())

print("
for i in range(H):
    A=input()
    print("
print("

Solution (Python):


from collections import *

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

for _ in range(H):
    print('

print('

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

Solution (Python):
def main():
    H, W = map(int, input().split())
    s = list()
    s.append('
    s.extend(['
    s.append('
    for ss in s:
        print(ss)


if __name__ == "__main__":
    main()

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((w+2)*"
for i in range(h):
    print("
print((w+2)*"

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

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

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

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

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

ans=['
i=1
while i<=H:
    ans[i]='
    i+=1
ans[H+1]='

for j in ans:
    print(j)

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

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):
import sys
def input(): return sys.stdin.readline().strip()

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

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

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

Solution (Python):
a, b = map(int, input().split())
print("
for i in range(a):
  c = input()
  print("
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=[]
for i in range(h):
  A.append(input())
print("
for i in range(h):
  print("
print("