[백준]2차원 행렬문제 2738, 2566, 10798, 2563

#2738
# 3 3
# 1 1 1
# 2 2 2
# 0 1 0
# 3 3 3
# 4 4 4
# 5 5 100


li_2 = []
a, b= map(int, input().split())
for i in range(a):
    row=list(map(int, input().split()))
    li_2.append(row)
    


for i in range(a):
    row=list(map(int, input().split()))
    for j in range(b):
        li_2[i][j]=li_2[i][j]+row[j]

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

#2566
"""3 23 85 34 17 74 25 52 65
10 7 39 42 88 52 14 72 63
87 42 18 78 53 45 18 84 53
34 28 64 85 12 16 75 36 55
21 77 45 35 28 75 90 76 1
25 87 65 15 28 11 37 28 74
65 27 75 41 7 89 78 64 39
47 47 70 45 23 65 3 41 44
87 13 82 38 31 12 29 29 80
90
5 7"""


li_2 = []
maxnum = 0
x, y = 0, 0
for i in range(9):
    row=list(map(int, input().split()))
    li_2.append(row)
    
for i in range(9):
    num=max(li_2[i])
    if maxnum < num:
        j=li_2[i].index(num)
        maxnum=num
        x, y = i, j
            
print(maxnum)
print(x+1,y+1)

#10798
"""AABCDD
afzz
09121
a8EWg6
P5h3kx
Aa0aPAf985Bz1EhCz2W3D1gkD6x
"""
li_2 = []
maxlen=0
for i in range(5):
    row=input()
    maxlen=len(row) if len(row) > maxlen else maxlen
    li_2.append(list(row))
    
for i in range(maxlen):
    for j in li_2:
        if(len(j)<maxlen and i+1 > len(j)):
            continue
        else : 
            print(j[i], end="")

 

#2563
"""
3
3 7
15 7
5 2
"""

Lpaper=[[0 for _ in range(101)] for _ in range(101)]

n = int(input())

for i in range(n):
    x,y=map(int, input().split())
    for i in range(x,x+10):
        for j in range(y,y+10):
            Lpaper[i][j]=1
    
total=0
for row in Lpaper:
    total+=row.count(1)
print(total)