Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p03039 (python)

Fixed submission:
#!/usr/bin/env python3
import sys

MOD = 1000000007  # type: int

def mfact():
    f = [1]
    for i in range(1, 200007):
        f.append(f[-1] * i % MOD)
    return f

def inv(x):
    res = 1
    k = MOD - 2
    y = x
    while (k):
        if(k % 2 == 1):
            res = (res * y) % MOD
        y = (y ** 2) % MOD
        k = k // 2
    return res

def comb(n, k, f):
    a = f[n]
    b = f[n-k]
    c = f[k]
    bc = (b * c) % MOD
    return (a * inv(bc)) % MOD

def solve(N: int, M: int, K: int):
    ans = 0
    for i in range(N):
        for j in range(M):
            a = j * (j+1) // 2
            b = (M-1-j) * (M-1-j+1) // 2
            ans += (a+b) * i + M * (i*(i+1)//2) + a
            ans %= MOD
    f = mfact()
    ans *= comb(N*M-2, K-2, f)
    ans %= MOD
    print(ans)
    return


# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    M = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    solve(N, M, K)

if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python3
import sys

MOD = 1000000007  # type: int

def mfact():
    f = [1]
    for i in range(1, 20000):
        f.append(f[-1] * i % MOD)
    return f

def inv(x):
    res = 1
    k = MOD - 2
    y = x
    while (k):
        if(k % 2 == 1):
            res = (res * y) % MOD
        y = (y ** 2) % MOD
        k = k // 2
    return res

def comb(n, k, f):
    if n < k or n < 0 or k < 0:
        return 0
    a = f[n]
    b = f[n-k]
    c = f[k]
    bc = (b * c) % MOD
    return (a * inv(bc)) % MOD

def solve(N: int, M: int, K: int):
    ans = 0
    for i in range(N):
        for j in range(M):
            a = j * (j+1) // 2
            b = (M-1-j) * (M-1-j+1) // 2
            ans += (a+b) * i + M * (i*(i+1)//2) + a
            ans %= MOD
    f = mfact()
    ans *= comb(N*M-2, K-2, f)
    ans %= MOD
    print(ans)
    return


# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    M = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    solve(N, M, K)

if __name__ == '__main__':
    main()
Problem p03128 (python)

Fixed submission:
#!/usr/bin/env python3
import sys, math, fractions, itertools

l = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6]

def solve(N: int, M: int, A: "List[int]"):
    dp = [-1] * (N+10) # 初期化
    dp[0] = 0 # 初期化
    for i in range(N-1): # 各桁について考える
        for s in A: # 各使える数字をみる
            if dp[i] == -1 and i!=0: # 条件を満たすように作れない場合、continue
                continue
            if dp[i + l[s]] < dp[i]*10+s:
                dp[i + l[s]] = dp[i]*10+s
    print(dp[N])
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    M = int(next(tokens))  # type: int
    A = [ int(next(tokens)) for _ in range(M) ]  # type: "List[int]"
    solve(N, M, A)

if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python3
import sys, math, fractions, itertools

num = [2, 5, 5, 4, 5, 6, 3, 7, 6]

def solve(N: int, M: int, A: "List[int]"):
    dp = [-1e18] * (N+1)
    dp[0] = 0
    for i in range(1, N+1):
        m = 0
        for a in A:
            m = max(m, dp[i-num[a-1]]+1)
        dp[i] = m
    for i in range(1, N):
        if dp[i] == 0:
            dp[i] = -1
    dd = dp[N]
    ans = ''
    nn = N
    for i in range(dd):
        for a in reversed(sorted(A)):
            if dp[nn-num[a-1]] == dp[nn] - 1:
                ans += str(a)
                nn -= num[a-1]
                break
    print(ans)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    M = int(next(tokens))  # type: int
    A = [ int(next(tokens)) for _ in range(M) ]  # type: "List[int]"
    solve(N, M, A)

if __name__ == '__main__':
    main()
Problem p03129 (python)

Fixed submission:
N, K = [int(n) for n in input().split()]
answer = "YES"
if N // 2 + N % 2 >= K:
    answer = "YES"
else:
    answer = "NO"

print(answer)

Buggy submission (verdict: Runtime Error):
 N, K = [int(n) for n in input().split()]
 if N // 2 + N % 2 >= K:
     print("YES")
 else:
     print("NO")
Problem p03130 (python)

Fixed submission:
A = []
B = []
for i in range(3):
    a, b = [int(n) for n in input().split()]
    A.append(a)
    B.append(b)

counter = [0] * 4

for i in range(3):
    counter[A[i] - 1] += 1
    counter[B[i] - 1] += 1

oddscounter = 0

for i in range(4):
    if counter[i] % 2 == 1:
        oddscounter += 1

answer = "YES"
if oddscounter >= 3:
    answer = "NO"
else:
    answer = "YES"

print(answer)

Buggy submission (verdict: Runtime Error):
 A = []
 B = []
 for i in range(3):
     a, b = [int(n) for n in input().split()]
     A.append(a)
     B.append(b)

 counter = [0] * 4

 for i in range(3):
     counter[A[i] - 1] += 1
     counter[B[i] - 1] += 1

 oddscounter = 0

 for i in range(4):
     if counter[i] % 2 == 1:
         oddscounter += 1

 answer = ""
 if oddscounter >= 3:
     answer = "NO"
 else:
     answer = "YES"

 print(answer)
Problem p03219 (python)

Fixed submission:
X, Y = input().split()
X, Y = int(X), int(Y)

print(int(X + Y/2))

Buggy submission (verdict: Runtime Error):
import numpy as np
from operator import itemgetter

N, M = input().split()
N, M = int(N), int(M)
C = [input().split() for i in range(M)]

for i, c in enumerate(C):
  C[i] = [int(c[0]), int(c[1])]
  C[i].append(i)

C_sorted = sorted(C, key = lambda x: (x[0], x[1]))

counter = 1
current = 1

for c in C_sorted:
  if current < c[0]:
    counter = 1
  pref = str(c[0])
  num = str(counter)
  number = ''
  for i in range(6 - len(pref)):
    number += '0'
  number += pref
  for i in range(6 - len(num)):
    number += '0'
  number += num

  c.append(number)
  counter += 1
  current = c[0]

C_reversed = sorted(C_sorted, key = lambda x: x[2])

for c in C_reversed:
  print(c[3])
Problem p03238 (python)

Fixed submission:
N = int(input())

if N == 1:
  print('Hello World')
if N == 2:
  A = int(input())
  B = int(input())
  print(A+B)

Buggy submission (verdict: Runtime Error):
N = int(input())
L = [input().split() for i in range(N)]
answer = 0
center = []

for i in range(101):
  for j in range(101):
    List = []
    for l in L:
      if int(l[2]) != 0:
        List.append(int(l[2]) + abs(int(l[0]) - i) + abs(int(l[1]) - j))
      #else:
        #List.append(0)
    if len(list(set(List))) == 1:
      answer = List[0]
      center.append(i)
      center.append(j)

print(center[0], center[1], answer)
Problem p03239 (python)

Fixed submission:
N, T = input().split()
N, T = int(N), int(T)
R = [input().split() for i in range(N)]
 
for i, r in enumerate(R):
  R[i] = [int(r[0]), int(r[1])]
 
R_sorted = sorted(R, key = lambda x: x[0])
 
List = []
answer = 'TLE'
 
for r in R_sorted:
  if r[1] <= T:
    List.append(r[0])

if List:
  answer = min(List)

print(answer)

Buggy submission (verdict: Runtime Error):
N, T = input().split()
N, T = int(N), int(T)
R = [input().split() for i in range(N)]

for i, r in enumerate(R):
  R[i] = [int(r[0]), int(r[1])]

R_sorted = sorted(R, key = lambda x: x[0])

List = []
answer = 'TLE'

for r in R_sorted:
  if r[1] <= T:
    List.append(r[0])

print(min(List))
Problem p03240 (python)

Fixed submission:
#!/usr/bin/env python3
import sys


def solve(N: int, x: "List[int]", y: "List[int]", h: "List[int]"):
    X = 0
    Y = 0
    hh = 0
    for i in range(0, 101):
        for j in range(0, 101):
            H =  []
            s = 0
            for k in range(N):
                if h[k] > 0:
                    s += h[k]
                    H.append(h[k] + abs(x[k] - i) + abs(y[k] - j))
            if len(H) > 1 and len(list(set(H))) == 1:
                X, Y, hh = i, j, H[-1]
            elif len(H) == 1 and H[0] == s:
                X, Y, hh = i, j, H[0]

    print(X, Y, hh)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    x = [int()] * (N)  # type: "List[int]" 
    y = [int()] * (N)  # type: "List[int]" 
    h = [int()] * (N)  # type: "List[int]" 
    for i in range(N):
        x[i] = int(next(tokens))
        y[i] = int(next(tokens))
        h[i] = int(next(tokens))
    solve(N, x, y, h)

if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
N = int(input())
L = [input().split() for i in range(N)]
answer = 0
center = []

for i in range(101):
  for j in range(101):
    List = []
    for l in L:
      if int(l[2]) != 0:
        List.append(int(l[2]) + abs(int(l[0]) - i) + abs(int(l[1]) - j))
      else:
        List.append(0)
    print(List)
    if len(list(set(List))) == 1:
      answer = List[0]
      center.append(i)
      center.append(j)

print(center[0], center[1], answer)

Buggy submission (verdict: Runtime Error):
N = int(input())
L = [input().split() for i in range(N)]
answer = 0
center = []

for i in range(101):
  for j in range(101):
    List = []
    for l in L:
      if int(l[2]) != 0:
        List.append(int(l[2]) + abs(int(l[0]) - i) + abs(int(l[1]) - j))
      else:
        List.append(0)
    if len(list(set(List))) == 1:
      answer = List[0]
      center.append(i)
      center.append(j)

print(center[0], center[1], answer)
Problem p03262 (python)

Fixed submission:
import fractions

N, X = [int(n) for n in input().split()]
x = sorted([abs(int(n) - X) for n in input().split()])

if len(x) > 1:
  gcd = fractions.gcd(x[0], x[1])
  for i in x:
    gcd = fractions.gcd(gcd, i)
else:
  gcd = x[0]
print(gcd)

Buggy submission (verdict: Runtime Error):
import fraction

N, X = [int(n) for n in input().split()]
x = sorted([abs(int(n) - X) for n in input().split()])

if len(x) > 1:
  gcd = fraction.gcd(x[0], x[1])
  for i in x:
    gcd = fraction.gcd(gcd, i)
else:
  gcd = x[0]
print(gcd)

Buggy submission (verdict: Runtime Error):
import fraction

N, X = [int(n) for n in input().split()]
x = sorted([abs(int(n) - X) for n in input().split()])

if len(x) > 1:
  gcd = math.gcd(x[0], x[1])
  for i in x:
    gcd = math.gcd(gcd, i)
else:
  gcd = x[0]
print(gcd)

Buggy submission (verdict: Runtime Error):
import math

N, X = [int(n) for n in input().split()]
x = sorted([abs(int(n) - X) for n in input().split()])

if len(x) > 1:
  gcd = math.gcd(x[0], x[1])

  for i in x:
    gcd = math.gcd(gcd, i)
else:
  gcd = x[0]

print(gcd)
Problem p03292 (python)

Fixed submission:
a = sorted([int(n) for n in input().split()])
print(a[2] - a[0])

Buggy submission (verdict: Runtime Error):
import fractions

N = int(input())
A = [int(n) for n in input().split()]

def lcm(x, y):
  return x * y // fractions.gcd(x, y)

l = 1
for a in A:
  l = lcm(a, l)
B = [(l - 1) % a for a in A]
print(sum(B))
Problem p03294 (python)

Fixed submission:
import fractions

N = int(input())
A = [int(n) for n in input().split()]

def lcm(x, y):
  return x * y // fractions.gcd(x, y)

l = 1
for a in A:
  l = lcm(a, l)
B = [(l - 1) % a for a in A]
print(sum(B))

Buggy submission (verdict: Runtime Error):
import math

N = int(input())
A = [int(n) for n in input().split()]

def lcm(x, y):
  return x * y // math.gcd(x, y)

l = 1
for a in A:
  l = lcm(a, l)
B = [(l - 1) % a for a in A]
print(sum(B))
Problem p03338 (python)

Fixed submission:
n = int(input())
s = input()
mx = 0
for i in range(n-1):
  a = [ord(aa) for aa in s[:i+1]]
  b = [ord(bb) for bb in s[i+1:]]
  counter = 0
  for c in range(ord('a'), ord('z')+1):
    if (c in a) and (c in b):
      counter += 1
  if mx < counter:
    mx = counter

print(mx)

Buggy submission (verdict: Runtime Error):
n = int(input())
s = input()
mx = 0
for i in range(N-1):
  a = [ord(aa) for aa in s[:i+1]]
  b = [ord(bb) for bb in s[i+1:]]
  counter = 0
  for c in range(ord('a'), ord('z')):
    if c in a and c in b:
      counter += 1
  if mx < counter:
    mx = counter

print(counter)
Problem p03436 (python)

Fixed submission:
#!/usr/bin/env python3
from collections import deque

def bfs(maze, visited, sy, sx, gy, gx):
    queue = deque([[sy, sx]])
    visited[sy][sx] = 0
    while queue:
        y, x = queue.popleft()
        if [y, x] == [gy, gx]:
            return visited[y][x]
        for j, k in ([1, 0], [-1, 0], [0, 1], [0, -1]):
            new_y, new_x = y+j, x+k
            if 0 <= y+j <= gy and 0 <= x+k <= gx:
                if maze[new_y][new_x] == "." and \
                    visited[new_y][new_x] == -1:
                    visited[new_y][new_x] = visited[y][x] + 1
                    queue.append([new_y, new_x])

def main():
    h, w = map(int, input().split())
    S = []
    for i in range(h):
        S.append(input())
    
    visited = [[-1]*w for j in range(h)]
    res = bfs(S, visited, 0, 0, h-1, w-1)
    if res == - 1 or res == None:
        print(-1)
    else:
        counter = 0
        for i in range(h):
            for j in range(w):
                if S[i][j] == '#':
                    counter += 1
        print(h*w-res-1-counter)


if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python3
from collections import deque

def bfs(maze, visited, sy, sx, gy, gx):
    queue = deque([[sy, sx]])
    visited[sy][sx] = 0
    while queue:
        y, x = queue.popleft()
        if [y, x] == [gy, gx]:
            return visited[y][x]
        for j, k in ([1, 0], [-1, 0], [0, 1], [0, -1]):
            new_y, new_x = y+j, x+k
            if 0 <= y+j <= gy and 0 <= x+k <= gx:
                if maze[new_y][new_x] == "." and \
                    visited[new_y][new_x] == -1:
                    visited[new_y][new_x] = visited[y][x] + 1
                    queue.append([new_y, new_x])

def main():
    h, w = map(int, input().split())
    S = []
    for i in range(h):
        S.append(input())
    
    visited = [[-1]*w for j in range(h)]
    res = bfs(S, visited, 0, 0, h-1, w-1)
    if res == -1:
        print(res)
    else:
        counter = 0
        for i in range(h):
            for j in range(w):
                if S[i][j] == '#':
                    counter += 1
        print(h*w-res-1-counter)


if __name__ == '__main__':
    main()
Problem p03485 (python)

Fixed submission:
import math
a, b = map(int, input().split())

print(math.ceil((a + b)/2))

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())

print(ceil((a + b)/2))
Problem p03486 (python)

Fixed submission:
s = input()
t = input()

s = sorted(s)
t = list(reversed(sorted(t)))

if s < t:
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
s = input()
t = input()

s = sorted(s)
t = reversed(sorted(t))

if s < t:
  print('Yes')
else:
  print('No')
Problem p03494 (python)

Fixed submission:
from fractions import gcd
n = int(input())
a = list(map(int, input().split()))
g = a[0]
for i in range(n):
  g = gcd(g, a[i])
counter = 0
while(True):
  if g % 2 != 0:
    break
  else:
    counter += 1
    g = g // 2
print(counter)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = map(int, input().split())
counter = 0
while(True):
  for i in range(n):
    if a[i] % 2 != 0:
      break
    else:
      a[i] = a[i] // 2
  counter += 1
print(counter)
Problem p03501 (python)

Fixed submission:
n, a, b = map(int, input().split())

print(min(n * a, b))

Buggy submission (verdict: Runtime Error):
n, a, b = map(int, inpit().split())

print(min(n * a, b))
Problem p03545 (python)

Fixed submission:
N = input()

answer = ""

for i in range(1 << 3):
    exp = N[0]
    for j in range(3):
        if i >> j & 1:
            exp += "+"
        else:
            exp += "-"
        exp += N[j + 1]
    if eval(exp) == 7:
        answer = exp
        break

print(answer + "=7")

Buggy submission (verdict: Runtime Error):
 N = input()

 answer = ""

 for i in range(1 << 3):
     exp = N[0]
     for j in range(3):
         if i >> j & 1:
             exp += "+"
         else:
             exp += "-"
         exp += N[j + 1]
     if eval(exp) == 7:
         answer = exp
         break

 print(answer + "=7")

Buggy submission (verdict: Runtime Error):
 N = input()

 for i in range(1 << 3):
     exp = N[0]
     for j in range(3):
         if i >> j & 1:
             exp += "+"
         else:
             exp += "-"
         exp += N[j + 1]
     if eval(exp) == 7:
         print(exp + "=7")
         break
Problem p03547 (python)

Fixed submission:
x, y = input().split()

if (ord(x) > ord(y)):
  print('>')
elif (ord(x) < ord(y)):
  print('<')
else:
  print('=')

Buggy submission (verdict: Runtime Error):
x, y = input().split()

print(max(int(x), int(y)))
Problem p03548 (python)

Fixed submission:
a, b, c = map(int, input().split())
p = 0
for i in range(a):
  if (b + c) * i + c <= a:
    p = i
  else:
    break
print(p)

Buggy submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
p = 0
for i in range(x):
  if (b + c) * i + c <= a:
    p = i
  else:
    break
print(p)
Problem p03563 (python)

Fixed submission:
r = int(input())
g = int(input())

print(r + (g-r) * 2)

Buggy submission (verdict: Runtime Error):
r, g = map(int, input().split())

print(r + (g-r) * 2)
Problem p03574 (python)

Fixed submission:
h, w = map(int, input().split())

S = []
for _ in range(h):
  S.append(input())

for i in range(h):
  ss = ''
  for j in range(w):
    if S[i][j] == '#':
      ss += '#'
    else:
      counter = 0
      for k in [-1, 0, 1]:
        for l in [-1, 0, 1]:
          if 0 <= i+k <= h-1 and 0 <= j+l <= w-1 and S[i+k][j+l] == '#':
            counter += 1
      ss += str(counter)
  print(ss)

Buggy submission (verdict: Runtime Error):
S = []
for _ in range(h):
  S.append(input())

for i in range(h):
  ss = ''
  for j in range(w):
    if S[i][j] == '#':
      ss += '#'
    else:
      counter = 0
      for k in [-1, 0, 1]:
        for l in [-1, 0, 1]:
          if 0 <= i+k <= h-1 and 0 <= j+l <= w-1 and S[i+k][j+l] == '#':
            counter += 1
      ss += str(counter)
  print(ss)
Problem p03624 (python)

Fixed submission:
s = input()
s = [ord(ss) for ss in s]
flag = []
for i in range(ord('a'), ord('z')+1):
  if i in s:
    flag.append(i)
if len(set(flag)) == 26:
  print('None')
else:
  for i in range(ord('a'), ord('z')+1):
    if i not in flag:
      print(chr(i))
      break

Buggy submission (verdict: Runtime Error):
s = input()
s = [ord(ss) in ss in s]
flag = False
for i in range(ord('a'), ord('z')+1):
  if i in s:
    flag = True
    ans = chr(i)
if flag:
  print(ans)
else:
  print('None')
Problem p03635 (python)

Fixed submission:
n, m = map(int, input().split())

print((n-1) * (m-1))

Buggy submission (verdict: Runtime Error):
n, m = map(int, input().split())

print((n-1)(m-1))
Problem p03719 (python)

Fixed submission:
a, b, c = map(int, input().split())

if a <= c and c <= b:
  print("Yes")
else:
  print('No')

Buggy submission (verdict: Runtime Error):
a, b, c = map(int, input().split())

if a <= c and c <= b:
  print("Yes")
eles:
  print('No')
Problem p03773 (python)

Fixed submission:
A, B = map(int, input().split())

print((A + B) % 24)

Buggy submission (verdict: Runtime Error):
A, B = map(int. input().split())

print((A + B) % 24)
Problem p03852 (python)

Fixed submission:
s = input()

if s in ['a', 'i', 'u', 'e', 'o']:
  print('vowel')
else:
  print('consonant')

Buggy submission (verdict: Runtime Error):
s = input()

if s in ['a', 'i', 'u', 'e'. 'o']:
  print('vowel')
else:
  print('consonant')
Problem p04011 (python)

Fixed submission:
n = int(input())
k = int(input())
x = int(input())
y = int(input())

if n <= k:
  print(n * x)
else:
  print(k * x + (n-k) * y)

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python3
import sys, math, fractions, itertools

def solve(N: int, A: int, x: "List[int]"):
    X = max(x)
    dp = [[[0 for _ in range(max(N*X+1, N*A+1))] for _ in range(N+1) ] for _ in range(N+1)]
    dp[0][0][0] = 1
    for n in range(N+1):
        for m in range(N+1):
            for k in range(N*X+1):
                if n >= 1 and k < x[n-1]:
                    dp[n][m][k] = dp[n-1][m][k]
                elif n >= 1 and m >= 1 and k >= x[n-1]:
                    dp[n][m][k] = dp[n-1][m][k] + dp[n-1][m-1][k-x[n-1]]
    s = 0
    for i in range(1, N+1):
        s += dp[N][i][i*A]
    print(s)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    A = int(next(tokens))  # type: int
    x = [ int(next(tokens)) for _ in range(N) ]  # type: "List[int]"
    solve(N, A, x)

if __name__ == '__main__':
    main()