monchy-monchy

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

A = []
for h in range(H):
    a = list(input())
    A.append(a)

row = [False] * H
col = [False] * W

monchy-monchy

x1, y1, x2, y2 = list(map(int, input().split()))

x = x2 - x1
y = y2 - y1

x3 = x2 - y
y3 = y2 + x
x4 = x1 - y
y4 = y1 + x

monchy-monchy

N = int(input())
W = []

check = True
s = ""
l = []
i = 0

for n in range(N):
    W = input()

monchy-monchy

N, M, X, Y = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))

x.append(X)
y.append(Y)

x.sort()
y.sort()

monchy-monchy

N = int(input())

c = 0

while N <= 999:
    n = str(N)
    if n[0] == n[1] == n[2]:
        c = N
        check = False
        break

monchy-monchy

N, T = list(map(int, input().split()))

r = 1001
check = False

for n in range(N):
    x, y = list(map(int, input().split()))
    if  y <= T:
        if x < r:
            r = x

monchy-monchy

N = int(input())
T, A = list(map(int, input().split()))
H = list(map(int, input().split()))

t = []

for n in range(N):
    tem = T - H[n]*0.006
    t.append(abs(A - tem))

monchy-monchy

S = input()

d = []

for i in range(len(S)):
    if i+3 <= len(S):
        s = S[i:i+3]
        d.append(abs(753-int(s)))

print(min(d))

monchy-monchy

N = int(input())

p = []
for n in range(N):
    p.append(int(input()))

p_max = max(p)
price = sum(p) - p_max + p_max//2

print(price)

monchy-monchy

S = int(input())

s = S
l = [s]
check = True
i = 1

while check:
    i += 1
    if s%2 == 0: