inspirit941

import sys
from collections import deque
import math
from itertools import combinations

n = int(sys.stdin.readline())
populations = list(map(int, sys.stdin.readline().split()))
populations.insert(0, 0)

maps = [[0 for _ in range(n+1)] for _ in range(n+1)]

inspirit941

import sys
from itertools import chain
from copy import deepcopy
n = int(sys.stdin.readline())
maps = [list(map(int, sys.stdin.readline().split())) for _ in range(n)]
max_value = 0

# 앞으로 기울이기 - 0
# 뒤로 기울이기 - 1
# 오른쪽으로 기울이기 - 2

inspirit941

import sys
from collections import deque

def bfs(start, connected):
    queue = deque()
    queue.append(start)
    visited = [0 for _ in range(N+1)]
    count = 1
    while queue:
        current = queue.popleft()

inspirit941

from itertools import permutations
def solution(n, weak, dist):
    # 1. 시계 / 반시계 문제 해결하기
    weak_length = len(weak)
    for i in range(weak_length):
        weak.append(weak[i] + n)
    # 4에서 반시계방향 = 9에서 시계방향. 
    # 즉 길이를 두 배 늘려놓으면 굳이 방향 고민할 필요 없다
    
    # 투입할 수 있는 친구의 최댓값. 

inspirit941

import sys
from collections import deque
n = int(sys.stdin.readline())
maps = [list(map(int, sys.stdin.readline().split())) for _ in range(n)]

# y 기준으로 x 탐색
def bfs(start, end, maps):
    queue = deque()
    queue.append(start)
    visited = set()

inspirit941

import sys
from itertools import permutations
from collections import deque
from copy import deepcopy
import math
y, x, n = map(int, sys.stdin.readline().split())
original_maps = [list(map(int, sys.stdin.readline().split())) for _ in range(y)]
arrs = [list(map(int,sys.stdin.readline().split())) for _ in range(n)]

# 1. 모든 경우의 수

inspirit941

def solution(left, right):
    left.insert(0,0)
    right.insert(0,0)
    
    # table[leftidx][rightidx] = left에서 idx빼낼 때, right에서 idx개 빼낼 때 최댓값.
    
    table = [[0 for _ in range(len(right))] for _ in range(len(left))]
    
    for y in range(1, len(left)):
        for x in range(1, len(right)):

inspirit941

from collections import deque, defaultdict
import math
import sys
sys.setrecursionlimit(10**6)
def find_parent(x, parent):
    if x == parent[x]:
        return x
    else:
        p = find_parent(parent[x], parent)
        parent[x] = p

inspirit941

import sys
import math

n, m = map(int, sys.stdin.readline().split())
maps = []
for y in range(n):
    arr = list(sys.stdin.readline())
    maps.append(arr)
    for x in range(len(arr)):
        if arr[x] == 'R':

inspirit941

import sys
n, c = map(int, sys.stdin.readline().split())
arr = []
for _ in range(n):
    arr.append(int(sys.stdin.readline()))

arr.sort()
start, end = 1, arr[-1] - arr[0]
result = 0
while start <= end: