print(int(-2/3)) # 0

_int = 13
_str = "duck"
_float = 3.1415926
_bool = True
_undefined = None # 這意義不大

print(type(_int)) # <class 'int'>
print(type(_str)) # <class 'str'>
print(type(_float)) # <class 'float'>
print(type(_bool)) # <class 'bool'>
print(type(_undefined)) # <class 'NoneType'>

_undefined = 7
print(type(_undefined)) # <class 'int'>

print(max(1, 3, 5, 9.14561, 16)) # 16
print(min(1, 3, 5, 9.14561, 16)) # 1

print(True and False) # False
print(True or False) # True
print(not True) # False

str1 = "abc"
str2 = "efg"

print(str1 + str2) # abcefg
print(str1 * 3) # abcabcabc

s = "adc"
s[1] = "b"
# TypeError: 'str' object does not support item assignment

ch = "a"
print(ord(ch)) # 97
print(ord(ch)+1) # 98

ch = "h"
print(ord(ch) - ord('a') + 1)

str = "A B C D E F G"
a, b, c, d, e, f, g = str.split()
print(d) # D

pi = 3.14159
r = 3
print(f"r = {r}, perimeter = {2*r*pi}, area = {r*r*pi}")

a, b = map(int, input().split())
print(a+b)
# 堆，你寫出了一個加法器

X = int(input())
result = "?"

if (X > 100):
	pass
elif (X <= 100 and X >= 90):
	result = "A+"
elif (X >= 85):
	result = "A"
elif (X >= 80):
	result = "A-"
elif (X >= 77):
	result = "B+"
elif (X >= 73):
	result = "B"
elif (X >= 67):
	result = "C+"
elif (X >= 63):
	result = "C"
elif (X >= 60):
	result = "C-"
elif (X >= 50):
	result = "D"
elif (X > 0):
	result = "F"

print(result)

while (True):
    # 這裡每次迴圈都會被執行到
    if (condition_1):
        continue # 回去第二行
    # 如果 condition_1，那這行就不會跑
    if (condition_2):
        break # 過去第 10 行
    # 如果 (condition_1 or condition_2)，這行就不會跑

# 這個不在迴圈中

print(type(range(1, 10, 1))) # <class 'range'>

for i in range(10, 0, -1):
    print(i)

for i in [1, 3, 5, 7, 9]:
    print(i)

n = 0
for i in range(1, 11, 1):
    n += i
print(n)

X = int(input())

now = True
# 如果 now 就加進 odd，否則加進 even
odd, even = 0, 0
while (X>0):
    if (now):
        odd += X%10
    else:
        even += X%10
    X = X // 10
    now = not now

print(abs(odd-even))

cart = [0] * 117 # 通常會故意開大一點以防萬一

a, b = map(int, input().split())
N = int(input())
ans = 0

for _ in range(N):
	line = list(map(int, input().split()))
	cart = [0] * 117
	for it in line:
		if (it == 0):
			break
		if (it > 0):
			cart[it] += 1
		else:
			cart[-it] -= 1

	if (cart[a] > 0 and cart[b] > 0):
		ans += 1

print(ans)

con = list(map(int, input().split()))
N = int(input())
ans = 0

for _ in range(N):
	line = map(int, input().split())
	cart = [0] * 117
	for it in line:
		if (it == 0):
			break
		if (it > 0):
			cart[it] += 1
		else:
			cart[-it] -= 1

	judge = True
    for it in con:
      if (cart[it] <= 0):
        judge = False
        braek
    if (judge) ans += 1

print(ans)

m = int(input())
arr = [0] * (m+17)
arr[0] = 0
arr[1] = 1

for i in range(2, m+1, 1):
	arr[i] = arr[i-1] + arr[i-2]

print(arr[m-1])

tu_1 = (1, 2)
tu_2 = (3, 4, 5, 6)
tu_3 = (7, "st", 1.34, True)
a, b = 8, 9
tu_4 = tuple(a, b)

tu = (1, 2)
print(tu[0]) #1
print(tu[1]) #2
print(tu[2]) # IndexError: tuple index out of range

tu = (1, 2)
tu = (3, tu[1])

s = "abcdefg"
# 補充一下，如果你不打上界，它就會跑到底
s = 'A' + s[1:]
# 所以 s[1:] 就是從 index=1 跑到最後一個字母

a = (1, 2)
b = (3, 4)
print(a+b) # (1, 2, 3, 4)
print(a*2) # (1, 2, 1, 2)

li = [3, 5, 1, 7, 9, 6, 1.8]
# 把一個整理完的 list 賦值給 li
li = sorted(li)
print(li) # [1, 1.8, 3, 5, 6, 7, 9]

li = [3, 5, 1, 7, 9, 6, 1.8]
# 把一個整理完的 list 賦值給 li
li = sorted(li)
print(li) # [1, 1.8, 3, 5, 6, 7, 9]

N = int(input())
L = list(map(int, input().split()))
L = sorted(L)

for it in L:
	print(L, end = " ")

N = int(input())
L = []
for _ in range(N):
	row_text = input()
	# 紀錄每個字母出現過幾次，因為不知道字串長什麼樣子，所以我開比較大
	alphabet = [0]*100
	for ch in row_text:
		alphabet[ord(ch) - ord('a')] += 1

	# 相異字母數
	repeat = 0

	for letter in alphabet:
		# 如果這個字母出現的次數大於零，反正就是它有出現過
		if (letter > 0):
			repeat += 1

	# 把他們包成 tuple 丟進 list
	L.append((repeat, row_text))

# 現在 list 中最小的就是答案！
L = sorted(L)
# L 中最小的是 L[0]，而你要取 L[0] 的第 [1] 項
print(L[0][1])

"""
上面那行和下面等價
smallest = L[0]
print(smallest[1])
"""

while True:
	try:
		# 把你的 code 寫在這個無窮迴圈裡，要兩個縮排
		# 第一行我給你了，可以接著寫
		N = int(input())

	except EOFError:
		# 不要刪掉這行
		break

# Sample Input
8 # N
3 # Q
5
-3
-7

# Sample Output

# Sample Input
8 # N
3 # Q
2 3 5 7 11 13 17 19
5
-3
-7

# Sample Output
20

# Sample Input
8 # N
3 # Q
5
-3
-7

# Sample Output

# Sample Input
8 # N
3 # Q
2 3 5 7 11 13 17 19
5
-3
-7

# Sample Output
20

# Sample Input
8 # N
3 # Q
5
-3
-7

# Sample Output

# Sample Input
8 # N
3 # Q
2 3 5 7 11 13 17 19
5
-3
-7

# Sample Output
20

# Sample Input
8 # N
3 # Q
5
-3
-7

# Sample Output

# Sample Input
8 # N
3 # Q
2 3 5 7 11 13 17 19
5
-3
-7

# Sample Output
20

# 這邊創造一個 3*3 的二維陣列

graph = []
for _ in range(3):
  tmp = [0]*3 # [0, 0, 0]
  graph.append(tmp)

# [[0, 0, 0], [0, 0, 0], [0, 0, 0]]
print(graph)

graph = [[0]*10 for _ in range(10)]

# 把第 i 列第 j 項設成 i*j
for i in range(1, 10, 1):
  for j in range(1, 10, 1):
    graph[i][j] = i*j

# 其實這樣印會多一個行末空格，但通常沒差
# 如果題目有明言禁止，那再特別處理就好
for i in range(1, 10, 1):
  for j in range(1, 10, 1):
    print(graph[i][j], end = " ")
  # 換行
  print()

# Sample Input
4 # N
3 # Q
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
R
D
D

# Sample Output
18

# Sample Input
4 # N
3 # Q
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
R
D
D

# Sample Output
18

# Sample Input
4 # N
3 # Q
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
R
D
D

# Sample Output
18

# Sample Input
4 # N
3 # Q
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
R
D
D

# Sample Output
18

graph = [[0]*(N+17) for _ in range(N+17)]

for i in range(1, N+1, 1):
  line = list(map(int, input().split()))
  graph[i][1:N+1] = line

graph = [[0]*(N+17) for _ in range(N+17)]

for i in range(1, N+1, 1):
  line = list(map(int, input().split()))
  index = 0
  for j in range(1, N+1, 1):
    graph[i][j] = line[index]
    index += 1

graph = [list(map(int, sys.stdin.readline().split())) for _ in range(N)]

x, y = 1, 1
ans = 0
for _ in range(Q):
  opr = input()
  if (opr == 'U'):
    x = max(1, x-1)
  if (opr == 'D'):
    x = min(N, x+1)
  if (opr == 'R'):
    y = max(N, y+1)
  if (opr == 'L'):
    y = min(1, y-1)

  ans += graph[x][y]

N = int(input())
Q = int(input())
graph = [[0]*(N+17) for _ in range(N+17)]

for i in range(1, N+1, 1):
  line = list(map(int, input().split()))
  graph[i][1:N+1] = line

x, y = 1, 1
ans = 0
for _ in range(Q):
  opr = input()
  if (opr == 'U'):
    x = max(1, x-1)
  if (opr == 'D'):
    x = min(N, x+1)
  if (opr == 'R'):
    y = min(N, y+1)
  if (opr == 'L'):
    y = max(1, y-1)

  ans += graph[x][y]
 
print(ans)

# 宣告自定義函數
def 函式名稱(參數1, 參數2, 參數3...):
  ...write something...
  return 回傳值

# 使用自定義函數
函數名稱(參數1, 參數2, 參數3...)

def greeting (name):
  print(f"Hello, {name}")
  
greeting(crocodile) # hello, crocodile

def pop_front_and_back (L):
  if (len(L) <= 1):
    return []
  L.pop(0)
  L.pop(-1)
  return L
  
print(pop_front_and_back([1, 3, 5, 7, 9])) # 3, 5, 7

li = [1, 3, 5, 7, 9]

def pop_front_and_back (L):
  if (len(L) <= 1):
    return []
  L.pop(0)
  L.pop(-1)
  return L
  
print(pop_front_and_back(li)) # [3, 5, 7]
print(li) # [3, 5, 7]

num = 17
def change_to_one(n):
  n = 1
  return n

print(change_to_one(num)) # 1
print(num) # 17

num = 17
def print_id(n):
  print(id(n)) # 140721529355192
  n = 3
  print(id(n)) # 140721529354744
  
print(id(num)) # 140721529355192
print_id(num) 

li = [1, 3, 5, 7, 9]

def print_id (L):
  print(id(L)) # 2203611419008
  L.pop()
  print(id(L)) # 2203611419008

print(id(li)) # 2203611419008
print_id(li)

text = "duck"

def cro (s):
  s = "crocodile"

cro(text)
print(text)

def func():
  a = 12
  b = 13
  return a

A = func()
print(A) # 12
print(b) # NameError: name 'b' is not defined

score = 18
def func():
  print(f"The score is {score}")
  
func() # The score is 18
score += 1
func() # The score is 19
score += 1
func() # The score is 20

score = 18
def func():
  score = 20
  print(f"The score is {score}")  # The score is 20
  
func()
print(score)  # 18

score = 18
def func():
  score += 1
  print(f"The score is {score}")
  # UnboundLocalError: cannot access local variable 'score' where it is not associated with a value
func()

score = 18
def func():
  global score
  score += 1
  print(f"The score is {score}")

func() # The score is 19
func() # The score is 20
func() # The score is 21

score = 18
def func():
  global score
  score = 20
  print(f"The score is {score}")

func()
print(score)

def is_bigger(x: int, y: int):
  return (x>y)

def collide (lx: int, ly: int, rx: int, ry: int, deep: int) -> None:
  global graph # 這是地圖深度
  global dino # 這是恐龍數輛
  awake = False # 範圍內有沒有恐龍醒著
  for i in range(lx, rx+1, 1):
    for j in range(ly, ry+1, 1):
      if (dino[i][j] > 0): 
        dino[i][j] = 0 # 如果醒著，就敲暈它
        awake = True

  if (awake): # 假設有敲恐龍，就不鑽地板
    return

  for i in range(lx, rx+1, 1):
    for j in range(ly, ry+1, 1):
      graph[i][j] -= deep

R, C, D = map(int, input().split())
graph = [[D]*(C+1) for _ in range(R+1)]
dino = [[0]*(C+1) for _ in range(R+1)]

K = int(input())
for _ in range(K):
  x, y = map(int, input().split())
  dino[x][y] += 1

Q = int(input())
for _ in range(Q):
  cx, cy, s, d = map(int, input().split())
  diff = s // 2
  collide(max(0, cx-diff), max(0, cy-diff), min(R-1, cx+diff), min(C-1, cy+diff), d)

R, C, D = map(int, input().split())
graph = [[D]*(C+1) for _ in range(R+1)]
dino = [[0]*(C+1) for _ in range(R+1)]

def collide (lx: int, ly: int, rx: int, ry: int, deep: int) -> None:
  global graph
  global dino
  awake = False
  for i in range(lx, rx+1, 1):
    for j in range(ly, ry+1, 1):
      if (dino[i][j] > 0):
        dino[i][j] = 0
        awake = True

  if (awake):
    return

  for i in range(lx, rx+1, 1):
    for j in range(ly, ry+1, 1):
      graph[i][j] -= deep


K = int(input())
for _ in range(K):
  x, y = map(int, input().split())
  dino[x][y] += 1

Q = int(input())
for _ in range(Q):
  cx, cy, s, d = map(int, input().split())
  diff = s // 2
  collide(max(0, cx-diff), max(0, cy-diff), min(R-1, cx+diff), min(C-1, cy+diff), d)

heightest, lowest = -100000, 100000
awake_dino = 0
for i in range(0, R, 1):
  for j in range(0, C, 1):
    heightest = max(heightest, graph[i][j])
    lowest = min(lowest, graph[i][j])
    awake_dino += dino[i][j]

print(f"{heightest} {lowest} {awake_dino}")

collect_1 = set() #ˊ這當然可以
collect_2 = {None} # 這也可以，會宣告一個裡面有一個元素 None 的 set
collect_3 = {} # 這不行，這會變成 dict

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

ans = 0
tmp = 1 # 目前累計的樓層數
for i in range(1, len(li), 1):
	if (li[i] < li[i-1]):
		# 如果下棟更低，那就繼續飛
		tmp += 1
	else:
		# 別飛了，更新答案
		ans = max(ans, tmp)
		# 看看把現在這棟當起點會不會更好
		tmp = 1

# 如果不加這行，你遇到一路遞減的 case 會爛掉，ans = 0
ans = max(ans, tmp)
print(ans)

N, M, Q = map(int, input().split())
graph = [[None]*(M+17) for _ in range(N+17)]
numbers = [None] * (int(10**6) + 17)

for i in range(1, N+1, 1):
  # 加一個 None 只是為了 index 能對上
  line = [None] + list(map(int, input().split()))
  for j in range(1, M+1, 1):
    graph[i][j] = line[j]
    numbers[line[j]] = (i, j)


for _ in range(Q):
  num = int(input())
  tar = numbers[num]
  output = []
  x, y = tar[0], tar[1]

  if (graph[x-1][y] is not None):
    output.append(graph[x-1][y])
  else:
    output.append(graph[N][y])

  if (graph[x+1][y] is not None):
    output.append(graph[x+1][y])
  else:
    output.append(graph[1][y])

  if (graph[x][y-1] is not None):
    output.append(graph[x][y-1])
  else:
    output.append(graph[x][M])

  if (graph[x][y+1] is not None):
    output.append(graph[x][y+1])
  else:
    output.append(graph[x][1])

  output = sorted(output)
  print(f"{output[0]} {output[1]} {output[2]} {output[3]}")

def rotate(ori: list[list]) -> list[list]:
  R, C = len(ori), len(ori[0])
  ret = [[None]*R for _ in range(C)] # 旋轉過了
  x, y = C-1, 0
  for i in range(0, R, 1):
    for j in range(0, C, 1):
      # print(f"(R, C) = ({R}, {C}), (i, j) = ({i}, {j}), (x, y) = ({x}, {y})")
      ret[x][y] = ori[i][j]
      x -= 1
      if (x < 0):
        x = C-1
        y += 1

  return ret

def flip(ori: list[list]) -> list[list]:
  R, C = len(ori), len(ori[0])
  ret = [[None]*C for _ in range(R)]
  x, y = R-1, 0
  for i in range(0, R, 1):
    for j in range(0, C, 1):
      # print(f"(R, C) = ({R}, {C}), (i, j) = ({i}, {j}), (x, y) = ({x}, {y})")
      ret[x][y] = ori[i][j]
      y += 1
      if (y >= C):
        y = 0
        x -= 1

  return ret

R, C, Q = map(int, input().split())
mat = [[None]*C for _ in range(R)]
for i in range(R):
  line = list(input().split())
  mat[i][0:C] = line

command = list(map(int, input().split()))
command = command[::-1] # 因為要逆推
for it in command:
  if it == 0:
    mat = rotate(mat)
  if it == 1:
    mat = flip(mat)

print(f"{len(mat)} {len(mat[0])}")
for line in mat:
  print(' '.join(line))

N, M = map(int, input().split())
maps = [[None]*(M+17) for _ in range(N+17)]
graph = [[0]*(M+17) for _ in range(N+17)]

for i in range(1, N+1, 1):
  line = list(map(int, input().split()))
  maps[i][1:M+1] = line

dire = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for i in range(1, N+1, 1):
  for j in range(1, M+1, 1):
    if (maps[i][j] == 1):
      graph[i][j] += 1
      for it in dire:
        graph[i + it[0]][j + it[1]] += 1
    elif (maps[i][j] == 2):
      for k in range(1, M+1, 1):
        graph[i][k] += 1
      for k in range(1, N+1, 1):
        graph[k][j] += 1
      graph[i][j] -= 1 # 中心會多算到一次

for i in range(1, N+1, 1):
  for j in range(1, M+1, 1):
    print(graph[i][j], end = ' ')
  print()

N, M, K, R, C = map(int, input().split())
graph = [[-1]*(M+17) for _ in range(N+17)]
px, py = R+1, C+1 # 現在位置，我把 0-based 校正成 1-based 了
dire = [(0, 1), (1, 0), (0, -1), (-1, 0)] # 右、下、左、上
index = 0 # 代表現在面向哪裡

for i in range(1, N+1, 1): # 吃輸入
	line = list(map(int, input().split()))
	graph[i][1:M+1] = line

def turn(index: int) -> int: # 右轉
	if (index+1 < 4):
		return (index+1)
	return 0

if (graph[px][py] == 0): # 特判：機器人根本不該走路
	print(0)
else:
	score = graph[px][py]
	graph[px][py] -= 1
	gem = 1
	while True:
		# 要轉彎嗎？
		if (score%K == 0):
			index = turn(index)
		nx = px+dire[index][0] # 新座標
		ny = py+dire[index][1] # 新座標
		while (graph[nx][ny] == -1): # 撞牆就轉彎到沒有牆為止
			index = turn(index) 
			nx = px+dire[index][0]
			ny = py+dire[index][1]
		# 走路
		px, py = nx, ny
		# 要停下來嗎？
		if (graph[px][py] == 0):
			break
		# 撿寶石
		score += graph[px][py]
		graph[px][py] -= 1
		gem += 1

print(gem)

R, C = map(int, input().split())
graph_1 = [[None]*C for _ in range(R)]
graph_2 = [[None]*C for _ in range(R)]

# 吃輸入
for i in range(0, R, 1):
	line = list(map(int, input().split()))
	graph_1[i][0:C] = line
for i in range(0, R, 1):
	line = list(map(int, input().split()))
	graph_2[i][0:C] = line

# 拿來比較兩張圖，回傳相似度
def cmp(A, B) -> int: # A、B 都是 graph
	if (len(A) != len(B) or len(A[0]) != len(B[0])): # 尺寸不符
		return 0
	S = 0
	for i in range(0, R, 1):
		for j in range(0, C, 1):
			if (A[i][j] == B[i][j]):
				S += 1

	ret = int(S/(R*C) * 100)
	return ret

# 拿來順時針把圖旋轉 90 度，回傳轉完的圖
def turn(G): # parameter 和 return value 都是 graph
	length, width = len(G), len(G[0])
	NG = [[None]*length for _ in range(width)] # 記得反轉長寬
	for i in range(0, length, 1):
		for j in range(0, width, 1):
			# 右到左、上到下，-1 是為了校正回 0-based
			NG[j][length-1-i] = G[i][j]

	return NG

ans = -1
for _ in range(4):
	ans = max(ans, cmp(graph_1, graph_2))
	graph_1 = turn(graph_1)
print(f"{ans}%")