Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
N,K,Q = map(int, input().split())
A = [int(input()) for i in range(Q)]
x = np.array([K]*N)
x_1 = np.array([-1]*N)
for j in range(Q):
    answer = A[j]-1
    x = x+x_1
    x[answer] =x[answer]+1
for k in range(N):
    if x[k]>=1:
        print('Yes')
    else:
        print('No')

Fixed submission:
import numpy as np
N,K,Q = map(int, input().split())
A = [int(input()) for i in range(Q)]
x = np.array([K-Q]*N)
for j in range(Q):
    x[A[j]-1]+=1
for k in range(N):
    if x[k]>=1:
        print('Yes')
    else:
        print('No')
Buggy python submission (verdict: Time Limit Exceeded):
K,S = map(int,input().split())
count = 0
for l in range(K+1):
    for m in range(K+1):
        for n in range(K+1):
            s = l+m+n
            if s==S:
                count = count+1
print(count)

Fixed submission:
K,S=input().split()
K=int(K)
S=int(S)
A=0
for x in range(0,K+1):
    for y in range(0,K+1):
        z=S-x-y
        if 0<=z<=K:
            A=A+1
print(A)

Buggy python submission (verdict: Time Limit Exceeded):
K,S=input().split()
K=int(K)
S=int(S)
A=0
for x in range(0,K+1):
    for y in range(0,K+1):
        for z in range(0,K+1):
            if x+y+z==S:
                A=A+1
print(A)

Fixed submission:
K,S=input().split()
K=int(K)
S=int(S)
A=0
for x in range(0,K+1):
    for y in range(0,K+1):
        z=S-x-y
        if 0<=z<=K:
            A=A+1
print(A)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
x = 0
for i in range(0,n-1):
    y = 0
    for j in range(i+1, n):
        y = y + a[j]

    x = (x + (a[i]*y) % (10**9+7)) % (10**9+7)

print(x)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
x = 0
y = 0
for i in range(0,n):
    x = x + a[i]
for i in range(0,n):
    y = y + (a[i]**2)
print(((x**2-y)//2) % (10**9+7))
Buggy python submission (verdict: Runtime Error):
wqydcgy

Fixed submission:
n = int(input())
if n>= 30:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
a = list(map(int, input().split()))
b = list(map(int, input().split()))

x = [1]*(a[0]-a[1]+1)

for i in range(a[1]-1,len(b)):
    for j in range(0,a[1]):
        x[i-(a[1]-1)] = x[i-a[1]+1]*b[i-j]

for i in range(1, len(x)):
    if int(x[i]) > int(x[i-1]):
        print("Yes")
    else:
        print("No")

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

for i in range(a[1],len(b)):
    if b[i]>b[i-a[1]]:
        print("Yes")
    else:
        print("No")
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = math.floor(a**0.5) + 1

x = []
for i in range(1,b):
    for j in range(1,b):
        for k in range(1,b):
            l = i**2 + j**2 + k**2 + i*j + j*k + k*i
            x.append(l)

t = [0] * a
for i in range(0,len(x)):
    if x[i] <= a:
        t[x[i]] = t[x[i]] + 1

for i in t:
    print(i)

Fixed submission:
a = int(input())
b = round(a**0.5) + 1

x = []
for i in range(1,b):
    for j in range(1,b):
        for k in range(1,b):
            l = i**2 + j**2 + k**2 + i*j + j*k + k*i
            x.append(l)

t = [0] * a
for i in range(0,len(x)):
    if x[i] <= a:
        t[x[i]-1] = t[x[i]-1] + 1

for i in t:
    print(i)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int,input().split()))

sum=0
for i in range(n):
    for j in range(i):
        sum+=a[i]*a[j]

ans=sum%(10**9+7)

print(ans)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
x=sum(a)
y=0
for i in range(n):
    y+=a[i]**2

ans = (x**2 - y)//2

ans = ans % (10**9+7)

print(int(ans))
Buggy python submission (verdict: Runtime Error):
N=int(input())
a=list(map(int,input().split()))
count=0
for i in range(0,N+1,2):
    if a[i]%2==1:
        count+=1

print(count)


Fixed submission:
N=int(input())
a=list(map(int,input().split()))
count=0
for i in range(0,N,2):
    if a[i]%2==1:
        count+=1

print(count)
Buggy python submission (verdict: Runtime Error):

N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))

max=0

A.insert(0, 0)
A = numpy.cumsum(A)
B.insert(0,0)
B = numpy.cumsum(B)

ans,j=0,M
for i in range(N+1):
    if a[i] > K:
        break
    while b[j] > K - a[i]:
        j-=1

    ans=max(ans,i+j)

print(ans)

Fixed submission:
N,M,K=map(int,input().split())
A=list(map(int,input().split()))
B=list(map(int,input().split()))

a,b=[0],[0]
for i in range(N):
    a.append(a[i]+A[i])
for i in range(M):
    b.append(b[i]+B[i])

ans,j=0,M

for i in range(N+1):
    if a[i] > K:
        break
    while b[j] > K - a[i]:
        j-=1
    
    ans = max(ans,i+j)

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
import numpy


N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))

max=0

A.insert(0, 0)
A = numpy.cumsum(A)
B.insert(0,0)



for i in range(N+1):
    hp=K
    hp-=A[i]

    if hp < 0:
        break

    for j in range(M+1):
        hp-=B[j]

        if hp < 0:
            break

        if max < i+j :
            max = i+j

print(max)



Fixed submission:
N,M,K=map(int,input().split())
A=list(map(int,input().split()))
B=list(map(int,input().split()))

a,b=[0],[0]
for i in range(N):
    a.append(a[i]+A[i])
for i in range(M):
    b.append(b[i]+B[i])

ans,j=0,M

for i in range(N+1):
    if a[i] > K:
        break
    while b[j] > K - a[i]:
        j-=1
    
    ans = max(ans,i+j)

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
a=list(map(int,input().split()))
Q=int(input())
l=[0]*Q
for i in range(Q):
    l[i]=list(map(int,input().split()))
    
for i in range(Q):    
    a = [(l[i][1] if s == l[i][0] else s) for s in a]
    print(sum(a))


Fixed submission:
import collections

N=int(input())
a=list(map(int,input().split()))
Q=int(input())
l=[0]*Q
for i in range(Q):
    l[i]=list(map(int,input().split()))

answer=sum(a)

b=collections.Counter(a)
    
for i in range(Q):    
    num=b[l[i][0]]
    variance=l[i][1]-l[i][0]
    answer+=variance*num
    print(answer)
    b[l[i][0]]=0
    b[l[i][1]]+=num
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int,input().split()))

num=0
for i in range(n):
    count=0
    for j in range (n):
        if a[i]%a[j]==0:
            count+=1
        
    if count==1:
            num+=1

print(num)

Fixed submission:
import collections

n=int(input())
a=list(map(int,input().split()))
M=max(a)

c=[0 for _ in range(M+1)]

for i in a:
    if c[i] != 0:
        c[i] = 2
        continue 
    for j in range(i,M+1,i):
        c[j]+=1

answer = 0

for i in a:
    if c[i] == 1:
        answer+=1


print(answer)
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
list1=list(map(int,input().split()))
list2=[0]*N

for i in range(N):
    list2[i]=list1.count(i+1)

def choose2(n):
    return n*(n-1)/2

total=0
for i in list2:
    total+=choose2(i)


for i in list1:
    ans=total-(list2[i-1]-1)
    print(int(ans))

Fixed submission:
from collections import Counter

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

dic1=Counter(list1)

def choose2(n):
    return n*(n-1)/2

sum=0
for key in dic1:
    sum+=choose2(dic1[key])

for i in list1:
    print(int(sum-dic1[i]+1))

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
list1=list(map(int,input().split()))
list2=[0]*N

for i in range(N):
    list2[i]=list1.count(i+1)

def choose2(n):
    return n*(n-1)/2

total=0
for i in list2:
    total+=choose2(i)


for i in list1:
    ans=total-(list2[i-1]-1)
    print(int(ans))

Fixed submission:
from collections import Counter

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

dic1=Counter(list1)

def choose2(n):
    return n*(n-1)/2

sum=0
for key in dic1:
    sum+=choose2(dic1[key])

for i in list1:
    print(int(sum-dic1[i]+1))
Buggy python submission (verdict: Runtime Error):
N=int(input())
list=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
print(list[N+1])

Fixed submission:
N=int(input())
list=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
print(list[N-1])
Buggy python submission (verdict: Time Limit Exceeded):
H,W=map(int,input().split())
sum=0
for i in range(H):
    for j in range(W):
        if (i-j)%2==0:
            sum+=1
print(sum)

Fixed submission:
import math
H,W=map(int,input().split())
sum=0
# for i in range(H):
#     for j in range(W):
#         if (i-j)%2==0:
#             sum+=1
if H==1 or W==1:
    print(1)
else:
    sum=(H*W)/2
    print(math.ceil(sum))
Buggy python submission (verdict: Runtime Error):
import sys
x, n = map(int, input().split())
if n == 0:
    print(x)
    sys.exit()

if x == 1:
    print(0):
    sys.exit()


if n == 100:
    if x <= 50:
        print(0)
        sys.exit()
    else:
        print(101)
        sys.exit()


nun_list = list(map(int, input().split()))
answer = 0

for i in range(0, 210):
    if nun_list.__contains__(i):
        continue
    else :
        if abs(x - answer) >= abs(x - i):
            if abs(x - answer) == abs(x - i):
                if answer > i:
                    answer = i
            else:
                answer = i
if abs(x - answer) <= abs(x - 0):
    print(answer)
else :
    print(0)

Fixed submission:
import sys
x, n = map(int, input().split())
if n == 0:
    print(x)
    sys.exit()

if x == 1:
    print(0)
    sys.exit()


if n == 100:
    if x <= 50:
        print(0)
        sys.exit()
    else:
        print(101)
        sys.exit()


nun_list = list(map(int, input().split()))
answer = 0

for i in range(0, 210):
    if nun_list.__contains__(i):
        continue
    else :
        if abs(x - answer) >= abs(x - i):
            if abs(x - answer) == abs(x - i):
                if answer > i:
                    answer = i
            else:
                answer = i
if abs(x - answer) <= abs(x - 0):
    print(answer)
else :
    print(0)
Buggy python submission (verdict: Runtime Error):
n = int(input())
nun_list = list(map(int, input().split()))
count=0
hoge = len(nun_list) - 1
for i in range(1,n+1):
    if is_prime(nun_list[i-1]):
        count+=1
        continue
    tmp = 0
    for j in range(1,n+1):
        if i != j:
            if nun_list[i-1] % nun_list[j-1]  == 0:
                break
            else :
                tmp+=1
    if tmp == hoge:
        count+=1
print(count)

def is_prime(n):
    for i in range(2, n + 1):
        if i * i > n:
            break
        if n % i == 0:
            return False
    return n != 1

Fixed submission:
from collections import Counter
N = int(input())
A = list(map(int, input().split()))
cnt = Counter(A)
A.sort()
ans = 0
P = [0] * (10 ** 6 + 1)
for a in A:
    if P[a] == 0:
        for i in range(10 ** 7):
            x = a * i
            if x > 10 ** 6:
                break
            P[x] = 1
        if cnt[a] == 1:
            ans += 1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
nun_list = list(map(int, input().split()))
count=0
hoge = len(nun_list) - 1
for i in range(1,n+1):
    tmp = 0
    for j in range(1,n+1):
        if i != j:
            if nun_list[i-1] % nun_list[j-1]  == 0:
                break
            else :
                tmp+=1
    if tmp == hoge:
        count+=1
print(count)

Fixed submission:
from collections import Counter
N = int(input())
A = list(map(int, input().split()))
cnt = Counter(A)
A.sort()
ans = 0
P = [0] * (10 ** 6 + 1)
for a in A:
    if P[a] == 0:
        for i in range(10 ** 7):
            x = a * i
            if x > 10 ** 6:
                break
            P[x] = 1
        if cnt[a] == 1:
            ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
def main():
    s = list(input())
    t = list(input())

    common = 0
    max_common = 0
    for t_ind in range(len(t)):
        for char in s:
            if not common and char == t[t_ind]:
                common += 1
            elif char == t[common]:
                common += 1
            else:
                if common and common > max_common:
                    max_common = common
                common = 0
    print(len(t) - max_common)

if __name__ == '__main__':
    main()


Fixed submission:
def main():
    s = input()
    t = input()
    ans = 100000
    for i in range(len(s) - len(t) + 1):
        sub = s[i:i+len(t)]
        tmp = 0
        for j in range(len(sub)):
            if sub[j] != t[j]:
                tmp += 1
        ans = min([ans, tmp])
    print(ans)


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Time Limit Exceeded):
def main():
    n = int(input())
    l = sorted(list(map(int, input().split())), reverse=True)
    ll = len(l)
    ans = 0

    seen = []
    for i in range(ll):
        for j in range(i+1, ll):
            for k in range(j+1, ll):
                if len(set([l[i], l[j], l[k]])) != 3:
                    continue
                if l[j] + l[k] > l[i] and [i, j, k] not in seen:
                    ans += 1
                    seen.append([i, j, k])
    print(ans)


if __name__ == '__main__':
    main()


Fixed submission:
def main():
    n = int(input())
    l = list(map(int, input().split()))
    ll = len(l)
    ans = 0

    for i in range(ll):
        for j in range(i+1, ll):
            for k in range(j+1, ll):
                if len(set([l[i], l[j], l[k]])) != 3:
                    continue
                item = [l[i], l[j], l[k]]
                if max(item) < sum(item) - max(item):
                    ans += 1
    print(ans)


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
def main():
    X, K, D = map(int, input().split())
    if abs(X) == D:
        if K % 2 == 0:
            print(abs(X))
        else:
            print(0)
        return
    for i in range(K):
        plus = abs(X + D)
        minus = abs(X - D)
        if plus < minus:
            X += D
        else:
            X -= D
        print(X)
    print(abs(X)) 
            
if __name__ == '__main__':
    main()


Fixed submission:
def main():
    X, K, D = map(int, input().split())
    if abs(X) == D:
        if K % 2 == 0:
            print(abs(X))
        else:
            print(0)
        return

    diff = K * D - abs(X)
    if abs(diff) <= D:
        print(abs(diff))
        return
    elif diff < 0:
        print(abs(diff))
        return
    count_minus = abs(diff // (2 * D))
    if X > 0:
        dest = X - (K - count_minus) * D + count_minus * D
        dest2 = X - (K - count_minus - 1) * D + (count_minus + 1) * D
    else:
        dest = X + (K - count_minus) * D - count_minus * D
        dest2 = X + (K - count_minus - 1) * D - (count_minus + 1) * D

    print(abs(dest) if abs(dest) < abs(dest2) else abs(dest2))

if __name__ == '__main__':
    main()
Buggy python submission (verdict: Time Limit Exceeded):
def main():
    k = int(input())
    alt_7 = 7
    mod_k = 7
    count = 1
    while alt_7 % k != 0:
        mod_k = mod_k * 10 % k
        if mod_k == 0:
            print(-1)
            return
        alt_7 += mod_k
        count += 1
    print(count)

if __name__ == '__main__':
    main()


Fixed submission:
def main():
    k = int(input())
    a = [1]
    a.append(7 % k)
    [a.append((a[i-1] * 10 + 7) % k) for i in range(2, k+1)]
    for i in range(1, k+1):
        if a[i] == 0:
            print(i)
            return
    print(-1)

if __name__ == '__main__':
    main()
Buggy python submission (verdict: Time Limit Exceeded):
from functools import reduce
from operator import mul

n = int(input())
l = map(int, input().split())

seki = reduce(mul, l)
max = 1000000000000000000
print(-1 if seki > max else seki)

Fixed submission:
from functools import reduce
from operator import mul
import math

def main():
    n = int(input())
    l = list(map(int, input().split()))

    if 0 in l:
        print(0)
        return
    l_sorted = sorted(l, reverse=True)
    log = 0
    seki = 1
    for i in l_sorted:
        log += math.log10(i)
        if log > 18:
            print(-1)
            return
        elif log == 18:
            seki *= i
            if seki != 10 ** 18:
                print(-1)
                return
        else:
            seki *= i
    print(seki)
    return


if __name__ == '__main__':
    main()

Buggy python submission (verdict: Time Limit Exceeded):
from functools import reduce
from operator import mul

n = int(input())
l = map(int, input().split())

seki = reduce(mul, l)
max = 1000000000000000000
print(-1 if seki > max else seki)

Fixed submission:
from functools import reduce
from operator import mul
import math

def main():
    n = int(input())
    l = list(map(int, input().split()))

    if 0 in l:
        print(0)
        return
    l_sorted = sorted(l, reverse=True)
    log = 0
    seki = 1
    for i in l_sorted:
        log += math.log10(i)
        if log > 18:
            print(-1)
            return
        elif log == 18:
            seki *= i
            if seki != 10 ** 18:
                print(-1)
                return
        else:
            seki *= i
    print(seki)
    return


if __name__ == '__main__':
    main()

Buggy python submission (verdict: Time Limit Exceeded):
from functools import reduce
from operator import mul

n = int(input())
l = map(int, input().split())

seki = reduce(mul, l)
print(-1 if seki > 10 ** 18 else seki)

Fixed submission:
from functools import reduce
from operator import mul
import math

def main():
    n = int(input())
    l = list(map(int, input().split()))

    if 0 in l:
        print(0)
        return
    l_sorted = sorted(l, reverse=True)
    log = 0
    seki = 1
    for i in l_sorted:
        log += math.log10(i)
        if log > 18:
            print(-1)
            return
        elif log == 18:
            seki *= i
            if seki != 10 ** 18:
                print(-1)
                return
        else:
            seki *= i
    print(seki)
    return


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Time Limit Exceeded):
k = int(input())
target = 7
if k % 2 == 0:
  print(-1)
  exit()
for i in range(1000000 + 1):
  if target % k == 0:
    print(i + 1)
    exit()
  target *= 10
  target += 7
print(-1)

Fixed submission:
def main():

    k = int(input())
    a = [0] * (10 ** 6 + 1)
    a[0] = 7 % k
    if a[0] == 0:
        print(1)
        exit()
    for i in range(1, k + 1):
        a[i] = (a[i - 1] * 10 + 7) % k
        if a[i] == 0:
            print(i + 1)
            exit()
    print(-1)

if __name__ == '__main__':
    main()

Buggy python submission (verdict: Time Limit Exceeded):
def main():

    k = int(input())
    if k % 2 == 0:
        print('-1')
    else:
        for i in range(1, k + 1):
            target = int('1' * i) * 7
            if target % k == 0:
                print(i)
                break

if __name__ == '__main__':
    main()

Fixed submission:
def main():

    k = int(input())
    a = [0] * (10 ** 6 + 1)
    a[0] = 7 % k
    if a[0] == 0:
        print(1)
        exit()
    for i in range(1, k + 1):
        a[i] = (a[i - 1] * 10 + 7) % k
        if a[i] == 0:
            print(i + 1)
            exit()
    print(-1)

if __name__ == '__main__':
    main()
Buggy python submission (verdict: Time Limit Exceeded):
def exp_sum(n:int, k:int, P:list):
    each_sum = []
    mx, total, x = 0, 0, 0
    for i in range(k - 1, n + 1):
        total = exp_val_sum(P[:i])
        total = total - exp_val_sum(P[:(i - k + 1)]) + (P[i - k] + 1) / 2
        each_sum.append(total)
        total = 0

    return max(each_sum)

def exp_val_sum(X:list):
    total = (sum(X) + len(X)) / 2
    return total

def main():

    n, k = map(int, input().split())
    P = list(map(int, input().split()))
    ans = 0
    print(exp_sum(n, k, P))

if __name__ == "__main__":
    main()

Fixed submission:
def main():

    n, k = map(int, input().split())
    P = list(map(int, input().split()))
    # print(exp_sum(n, k, P))
    mx = 0
    for i in range(k):
        mx += (P[i] + 1) / 2
    tmp = mx
    for i in range(k, n):
        tmp += (P[i] - P[i - k]) / 2
        mx = max(mx, tmp)
    print(mx)

if __name__ == "__main__":
    main()

Buggy python submission (verdict: Time Limit Exceeded):
def exp_sum(n:int, k:int, P:list):
    each_sum = []
    mx, total, x = 0, 0, 0
    for i in range(k - 1, n + 1):
        total = exp_val_sum(P[:i])
        total = total - exp_val_sum(P[:(i - k + 1)]) + (P[i - k] + 1) / 2
        each_sum.append(total)
        total = 0

    return max(each_sum)

def exp_val_sum(X:list):
    total = 0
    for i in range(len(X)):
        total += (X[i] + 1) / 2
    return total

def main():

    n, k = map(int, input().split())
    P = list(map(int, input().split()))
    ans = 0
    print(exp_sum(n, k, P))

if __name__ == "__main__":
    main()

Fixed submission:
def main():

    n, k = map(int, input().split())
    P = list(map(int, input().split()))
    # print(exp_sum(n, k, P))
    mx = 0
    for i in range(k):
        mx += (P[i] + 1) / 2
    tmp = mx
    for i in range(k, n):
        tmp += (P[i] - P[i - k]) / 2
        mx = max(mx, tmp)
    print(mx)

if __name__ == "__main__":
    main()

Buggy python submission (verdict: Time Limit Exceeded):
def start_point(n, k, P):
    mx, total, x = 0, 0, 0
    for i in range(n - k + 1):
        for j in range(i, i + k):
            total += expected_value(P[j])
        mx = max(mx, total)
        if mx == total:
            x = i
        total = 0
    return x

def expected_value(p):
    value = 0
    for i in range(p + 1):
        value += i
    return value / p

def main():

    n, k = map(int, input().split())
    P = list(map(int, input().split()))
    ans = 0
    start = start_point(n, k, P)
    for i in range(start, start + k):
        ans += expected_value(P[i])
    print(ans)

if __name__ == "__main__":
    main()

Fixed submission:
def main():

    n, k = map(int, input().split())
    P = list(map(int, input().split()))
    # print(exp_sum(n, k, P))
    mx = 0
    for i in range(k):
        mx += (P[i] + 1) / 2
    tmp = mx
    for i in range(k, n):
        tmp += (P[i] - P[i - k]) / 2
        mx = max(mx, tmp)
    print(mx)

if __name__ == "__main__":
    main()
Buggy python submission (verdict: Runtime Error):
import math

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

def main():

    a, b = map(int, input().split())
    print(least_common_multiple(a, b))

if __name__ == "__main__":
    main()

Fixed submission:
def main():

    a, b = map(int, input().split())
    for k in range(1, b + 1):
        if a * k % b == 0:
            print(a * k)
            break
        else:
            continue

if __name__ == "__main__":
    main()