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

Fixed submission:
import math

Q = int(input())
sosu = [2]

for L in range(3, 10**5, 2): # 2 以外の素数は奇数なので
    for L2 in sosu:
        if L % L2 == 0:
            break # 素数でないことがわかったらそれ以上ループする必要はない
    else: # break で抜けることがなかったら L は素数（Python 特有の制御構文）
        sosu.append(L)

sosu = set(sosu)

d = {0:0}
now = 0
for x in range(1, 10**5+1):
    if x % 2 == 1:
        if x in sosu and (x+1)/2 in sosu:
            now += 1
    d[x] = now

li = []
for i in range(Q):
    l, r = map(int, input().split())
    li.append((l, r))

for l,r in li:
    ans = 0
    print(d[r]-d[l-1])

Buggy submission (verdict: Runtime Error):
import math

Q = int(input())
sosu = set(2)

for L in range(3, 10**5, 2): # 2 以外の素数は奇数なので
    for L2 in sosu:
        if L % L2 == 0:
            break # 素数でないことがわかったらそれ以上ループする必要はない
    else: # break で抜けることがなかったら L は素数（Python 特有の制御構文）
        sosu.add(L)


li = []
for i in range(Q):
    l, r = map(int, input().split())
    li.append((l, r))

for l,r in li:
    ans = 0
    for x in range(l, r+1):
        if x % 2 == 1:
            if x in sosu and (x+1)/2 in sosu:
                ans += 1
    print(ans)
Problem p02618 (python)

Fixed submission:
def AtCoderContestScheduling():

    Day = int(input())
    C_i = list(map(int,input().split()))
    
    last_d_i = [0]*26

    SatisfactionLevel_last = 0

    for num in range(1, Day+1):
        
        S_d_i = list(map(int,input().split()))
        
        SatisfactionLevel_list = []
        
        for num2 in range(26):
            SatisfactionLevel = SatisfactionLevel_last + S_d_i[num2]
            
            for num3 in range(26):
                if num2 != num3:
                    SatisfactionLevel = SatisfactionLevel - C_i[num3]*(num - last_d_i[num3])
 
            SatisfactionLevel_list.append(SatisfactionLevel)    

        index = SatisfactionLevel_list.index(max(SatisfactionLevel_list))

        last_d_i[index] = num

        SatisfactionLevel_last = SatisfactionLevel_list[SatisfactionLevel_list.index(max(SatisfactionLevel_list))]

        print(SatisfactionLevel_list.index(max(SatisfactionLevel_list)) + 1)

if __name__ == '__main__':
    AtCoderContestScheduling()

Buggy submission (verdict: Runtime Error):
import random

def AtCoderContestScheduling():

    Day = int(input())
    value_A = list(map(int,input().split()))
    
    SatisfactionLevel = [0]*26

    for num in range(Day):
        
        value_B = list(map(int,input().split()))
        
        if num == 0:
            SatisfactionLevel = [x + y for (x, y) in zip(SatisfactionLevel, value_B)]
            SumA = sum(value_A)
            SatisfactionLevel = [x - SumA + y for (x, y) in zip(SatisfactionLevel, value_A)]

            print(SatisfactionLevel.index(max(SatisfactionLevel)) + 1)

        else:
            SatisfactionLevel = [x + y for (x, y) in zip(SatisfactionLevel, value_B)]
            value_A_1 = value_A[value_A.index(max(value_A))] = 0
            SumA = sum(value_A)
            SatisfactionLevel = [x - (num + 1)*SumA + 2*y + z for (x, y, z) in zip(SatisfactionLevel, value_A, value_A_1)]

            print(SatisfactionLevel.index(max(SatisfactionLevel)) + 1)
            

if __name__ == '__main__':
    AtCoderContestScheduling()
Problem p02630 (python)

Fixed submission:
from collections import Counter

def Replacing():

    Num = int(input())

    value_A = list(map(int,input().split()))

    Sum = sum(value_A)
    Counter_value = Counter(value_A)

    NumB = int(input())

    for i in range(NumB):
        value_B = list(map(int,input().split()))

        Sum += (value_B[1] - value_B[0])*Counter_value[value_B[0]]
        Counter_value[value_B[1]] += Counter_value[value_B[0]]
        Counter_value[value_B[0]] = 0

        print(Sum)

if __name__ == '__main__':
    Replacing()

Buggy submission (verdict: Runtime Error):
from collections import Counter

def Replacing():

    Num = int(input())

    value_A = list(map(int,input().split()))

    Sum = sum(value_A)
    Counter_value = Counter(value_A)

    NumB = int(input())

    for i in range(NumB):
        value_B = list(map(int,input().split()))

        Sum += (value_B[1] - value_B[0])*Counter_value(value_B[0])
        Counter_value[value_B[1]] += Counter_value[value_B[0]]
        Counter_value[value_B[0]] = 0

        print(Sum)

if __name__ == '__main__':
    Replacing()

Buggy submission (verdict: Runtime Error):
from collections import Counter

def Replacing():

    Num = int(input())

    value_A = list(map(int,input().split()))

    Sum = sum(value_A)
    Counter_value = Counter(value_A)

    NumB = int(input())

    for i in range(NumB):
        value_B = list(map(int,input().split()))

        Sum += (value_B[1] - value_B[0])*Counter_value(value_B[0])
        Counter_value[Ci] += Counter_value[Bi]
        Counter_value[Bi] = 0

        print(Sum)

if __name__ == '__main__':
    Replacing()

Buggy submission (verdict: Runtime Error):
from collections import Counter

def Replacing():

    Num = int(input())

    value_A = list(map(int,input().split()))

    Sum = sum(value_A)
    Counter_value = Counter(value_A)

    NumB = int(input())

    for i in range(NumB):
        value_B = list(map(int,input().split()))

        Sum += (value_B[1] - value_B[0])*Counter_value(value_B[0])
        Counter_value[Ci] += Counter_value[Bi]
        Counter_value[Bi] = 0

        print(Sum)

if __name__ == '__main__':
    Replacing()
Problem p02641 (python)

Fixed submission:
import numpy as np

def ForbiddenList():

    NumA = list(map(int,input().split()))

    NumB = list(map(int,input().split()))

    if len(NumB) != 0:
        result = list(range(min(NumB)-1, max(NumB)+2, 1))

        for data in NumB:
            result.remove(data)

        idx = np.abs(np.asarray(result) - NumA[0]).argmin()

        print(result[idx])

    else:
        print(NumA[0])
    

if __name__ == '__main__':
    ForbiddenList()

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

def ForbiddenList():

    NumA = list(map(int,input().split()))

    NumB = list(map(int,input().split()))

    result = list(range(min(NumB)-1, max(NumB)+1, 1))

    for data in NumB:
        result.remove(data)

    idx = np.abs(np.asarray(result) - NumA[0]).argmin()

    print(result[idx])

if __name__ == '__main__':
    ForbiddenList()
Problem p02583 (python)

Fixed submission:
import collections
import itertools
def resolve():
    n = int(input())
    l = list(map(int, input().split()))
    c = collections.Counter(l)
    keys = c.keys()
    key_combinations = set(itertools.combinations(keys, 3))

    result = 0
    for combination in key_combinations:
        max_key = max(combination)
        if sum(combination) - max_key > max_key:
            # 三角形になる
            one_combination_result = 1
            for key in combination:
                one_combination_result = one_combination_result * c[key]
            result += one_combination_result
    print(result)
resolve()

Buggy submission (verdict: Runtime Error):
def resolve():
    n = int(input())
    l = list(map(int, input().split()))
    c = collections.Counter(l)
    keys = c.keys()
    key_combinations = set(itertools.combinations(keys, 3))

    result = 0
    for combination in key_combinations:
        max_key = max(combination)
        if sum(combination) - max_key > max_key:
            # 三角形になる
            one_combination_result = 1
            for key in combination:
                one_combination_result = one_combination_result * c[key]
            result += one_combination_result
    print(result)
resolve()
Problem p02614 (python)

Fixed submission:
import itertools
def resolve():
    H,W,K = map(int,input().split())
    bi = []
    bj = []
    for i in range(H):
        row = input()
        for j in range(W):
            if row[j]=='#':
                bi.append(i)
                bj.append(j)
    
    dellist = lambda items, indexes: [item for index, item in enumerate(items) if index not in indexes]
    # 行を削除してみる
    count = 0

    row_iters = [itertools.combinations(range(H), i) for i in range(0,H+1)]
    for row_iter in row_iters:
        for target_rows in row_iter:
            row_del_position = [i_position for i_position, i in enumerate(bi) for target_row in target_rows if i == target_row]
            #new_bi = dellist(bi, row_del_position)
            new_bj = dellist(bj, row_del_position)
            if len(new_bj)>=K:
                #print('bi>=K')
                #print(target_rows)
                #print(new_bi, new_bj)
                column_iters = [itertools.combinations(range(W), i) for i in range(0,W+1)]
                for column_iter in column_iters:
                    for target_columns in column_iter:
                        column_del_position = [j_position for j_position, j in enumerate(new_bj) for target_column in target_columns if j == target_column]
                        #new_bi2 = dellist(new_bi, column_del_position)
                        new_bj2 = dellist(new_bj, column_del_position)
                        
                        if len(new_bj2) == K:
                            #print('bi==K')
                            #print(target_columns)
                            count +=1
    print(count)
resolve()

Buggy submission (verdict: Runtime Error):
def resolve():
    H,W,K = map(int,input().split())
    bi = []
    bj = []
    for i in range(H):
        row = input()
        for j in range(W):
            if row[j]=='#':
                bi.append(i)
                bj.append(j)

    row_iters = [itertools.combinations(range(H), i) for i in range(0,H+1)]
    column_iters = [itertools.combinations(range(W), i) for i in range(0,W+1)]

    dellist = lambda items, indexes: [item for index, item in enumerate(items) if index not in indexes]
    # 行を削除してみる
    count = 0

    for row_iters in row_iters:
        for target_rows in row_iters:
            row_del_position = [i_position for i_position, i in enumerate(bi) for target_row in target_rows if i == target_row]
            new_bi = dellist(bi, row_del_position)
            new_bj = dellist(bj, row_del_position)
            if len(new_bi)>=K:
                for column_iters in column_iters:
                    for target_columns in column_iters:
                        column_del_position = [j_position for j_position, j in enumerate(bj) for target_column in target_columns if j == target_column]
                        new_bi = dellist(bi, column_del_position)
                        new_bj = dellist(bj, column_del_position)
                        if len(new_bi) == K:
                            count +=1
    print(count)
resolve()
Problem p02657 (python)

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

Buggy submission (verdict: Runtime Error):
N = int(input())
num = list(map(int,input().split()))
a = 1
for n in range(N):
  a = num[n]*a
if a> 10**18:
  a=-1
print(a)

Buggy submission (verdict: Runtime Error):
import numpy as np
N = int(input())
num = np.array(list(map(int,input().split())))

a = np.prod(num)
if a> 10**18:
  a=-1
print(a)

Buggy submission (verdict: Runtime Error):
A, B = input().split()
print(A*B)
Problem p02658 (python)

Fixed submission:
import sys
N = int(input())
num = list(map(int,input().split()))
num.sort(reverse=True)
a = 1
if num[-1] == 0:
  print(0)
else:
  for n in range(N):
    a = num[n]*a
    if a> 10**18:
      print(-1)
      sys.exit()
  print(a)

Buggy submission (verdict: Runtime Error):
N = int(input().split())
num = list(map(int,input().split()))
a = 1
for n in num:
  a = n*a
if a> 10**18:
  a=1
print(a)
Problem p02675 (python)

Fixed submission:
count = int(input()[-1])
if count == 2 or count == 4 or count == 5 or count == 7 or count == 9:
  print('hon')
elif count == 3:
  print('bon')
else:
  print('pon')

Buggy submission (verdict: Runtime Error):
import numpy as np
room, route_count = map(int,input().split())
route = np.array([list(map(int,input().split())) for _ in range(route_count)])
 
object_nums = [1]
ans = np.array([0]*(room-1))
 
def mem_ans(ans, object_num, next_nums):
    next_nums = next_nums - 2
    ans[next_nums-2] = object_num
    return ans
 
for object_num in object_nums:
    object_rows = route[np.any(route==object_num, axis=1)]
    route = route[~np.any(route==object_num, axis=1)]
    next_nums = object_rows[object_rows!=object_num]
    
    if next_nums is not None:
        ans = mem_ans(ans, object_num, next_nums)
        object_nums.extend(next_nums)
    else:
        break
if 0 in set(ans):
  print('No')
else:
  print('Yes')
  for i in ans:
    print(i)
Problem p02678 (python)

Fixed submission:
import networkx as nx
room, route_count = map(int,input().split())
route = [list(map(int,input().split())) for _ in range(route_count)]

G = nx.Graph()
G.add_nodes_from(range(1,room+1))
G.add_edges_from(route)
pre = nx.predecessor(G, 1)

print('Yes')
for i in range(2,room+1):
  print(pre[i][0])

Buggy submission (verdict: Runtime Error):
import numpy as np
room, route_count = map(int,input().split())
route = np.array([list(map(int,input().split())) for _ in range(route_count)])
 
object_nums = [1]
ans = np.array([0]*(room-1))
 
def mem_ans(ans, object_num, next_nums):
    mask_array = np.zeros(room-1, dtype=bool)
    mask_array[next_nums-2] = True
    ans[(ans==0) & mask_array] = object_num
    return ans
 
for object_num in object_nums:
    object_num_mask = np.any(route==object_num, axis=1)
    object_rows = route[object_num_mask]
    route = route[~object_num_mask]
    next_nums = object_rows[object_rows!=object_num]
    if next_nums is not None:
        ans = mem_ans(ans, object_num, next_nums)
        object_nums.extend(next_nums)
    else:
        break
 
if 0 in set(ans):
  print('No')
else:
  print('Yes')
  for i in ans:
    print(i)

Buggy submission (verdict: Runtime Error):
import numpy as np
room, route_count = map(int,input().split())
route = np.array([list(map(int,input().split())) for _ in range(route_count)])
 
object_nums = [1]
ans = np.array([0]*(room-1))
 
def mem_ans(ans, object_num, next_nums):
    mask_array = np.zeros(room-1, dtype=bool)
    mask_array[next_nums-2] = True
    ans[ans=0 & mask_array] = object_num
    return ans
 
for object_num in object_nums:
 
    object_rows = route[np.any(route==object_num, axis=1)]
    route[np.any(route==object_num, axis=1)] = 0
    next_nums = object_rows[object_rows!=object_num]
    if next_nums is not None:
        ans = mem_ans(ans, object_num, next_nums)
        object_nums.extend(next_nums)
    else:
        break
 
if 0 in set(ans):
  print('No')
else:
  print('Yes')
  for i in ans:
    print(i)

Buggy submission (verdict: Runtime Error):
import numpy as np
room, route_count = map(int,input().split())
route = np.array([list(map(int,input().split())) for _ in range(route_count)])
 
object_nums = [1]
ans = np.array([0]*(room-1))
 
def mem_ans(ans, object_num, next_nums):
    next_nums = next_nums - 2
    ans[next_nums-2] = object_num
    return ans
 
for object_num in object_nums:
    object_rows = route[np.any(route==object_num, axis=1)]
    route = route[~np.any(route==object_num, axis=1)]
    next_nums = object_rows[object_rows!=object_num]
    
    if next_nums is not None:
        ans = mem_ans(ans, object_num, next_nums)
        object_nums.extend(next_nums)
    else:
        break
print(ans)
if 0 in set(ans):
  print('No')
else:
  print('Yes')
  for i in ans:
    print(i)
Problem p02687 (python)

Fixed submission:
x = str(input())
if x == 'ABC':
  print('ARC')
else:
  print('ABC')

Buggy submission (verdict: Runtime Error):
input = input()
if input='ABC':
  print('ARC')
else:
  print('ABC')
Problem p02601 (python)

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

K = int(input())

flag = False

for i in range(0, K+1):
    for j in range(0, K+1):
        for k in range(0, K+1):
            x = A * 2**i
            y = B * 2**j
            z = C * 2**k
            # print(x, y, z)

            if x < y < z and i + j + k <= K:
                flag = True


if flag == True:
    print('Yes')
else:
    print('No')

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

K = int(input())


for i in range(0, K):
    for j in range(0, K):
        for k in range(0, K):
            x = A * 2**i
            y = B * 2**j
            z = C * 2**k

            if x < y < z:
                flag = True
                

if flag == True:
    print('Yes')
else:
    print('No')
Problem p02613 (python)

Fixed submission:
n = int(input())
a = [input() for i in range(n)]

c0, c1, c2, c3 = 0, 0, 0, 0

for output in a:
    if output == 'AC':
        c0 += 1
    elif output == 'WA':
        c1 += 1
    elif output == 'TLE':
        c2 += 1
    elif output == 'RE':
        c3 += 1
        
        
print('AC x {}'.format(c0))
print('WA x {}'.format(c1))
print('TLE x {}'.format(c2))
print('RE x {}'.format(c3))

Buggy submission (verdict: Runtime Error):
n = int(input())
a = [input()) for i in range(n)]

c0, c1, c2, c3 = 0, 0, 0, 0

for output in a:
    if output == 'AC':
        c0 += 1
    elif output == 'WA':
        c1 += 1
    elif output == 'TLE':
        c2 += 1
    elif output == 'RE':
        c3 += 1
        
        
print('AC x {}'.format(c0))
print('WA x {}'.format(c1))
print('TLE x {}'.format(c2))
print('RE x {}'.format(c3))

Buggy submission (verdict: Runtime Error):
n = int(input())
a = [int(input()) for i in range(n)]

c0, c1, c2, c3 = 0, 0, 0, 0

for output in a:
    if output == 'AC':
        c0 += 1
    elif output == 'WA':
        c1 += 1
    elif output == 'TLE':
        c2 += 1
    elif output == 'RE':
        c3 += 1
        
        
print('AC x {}'.format(c0))
print('WA x {}'.format(c1))
print('TLE x {}'.format(c2))
print('RE x {}'.format(c3))
Problem p02639 (python)

Fixed submission:
#intの場合


huga = list(map(int, input().split()))

if huga[0] == 0:
    print(1)
if huga[1] == 0:
    print(2)
if huga[2] == 0:
    print(3)
if huga[3] == 0:
    print(4)
if huga[4] == 0:
    print(5)

Buggy submission (verdict: Runtime Error):
#intの場合


huga = list(map(int, input().split()))

for i in range(len[huga]):
    if huga[i] == 0:
        print(huga[i])
Problem p02658 (python)

Fixed submission:
#intの場合
N = int(input()) #ここで標準入力

A = list(map(int, input().split()))

# multiple = 1
# for i in range(N):
#     multiple *= A[i]



# if multiple <= 10 ** 18 :
#     print(multiple)
# else:
#     print(-1)

def main():
    if 0 in A:
        print(0)
        return

    output = 1
    for a in A:
        output *= a

        if output > (10 ** 18):
            print(-1)
            return

    print(output)

main()

Buggy submission (verdict: Runtime Error):
#intの場合
N = int(input()) #ここで標準入力

A = list(map(int, input().split()))

# multiple = 1
# for i in range(N):
#     multiple *= A[i]



# if multiple <= 10 ** 18 :
#     print(multiple)
# else:
#     print(-1)


if 0 in A:
    print(0)
    return

output = 1
for a in A:
    output *= a
    
    if output > 10 ** 18:
        print(-1)
        return

print(output)
Problem p02675 (python)

Fixed submission:
N = str(input()) #ここで標準入力

car = ''
if N[-1] == '3':
    car = 'bon'
elif N[-1] == '0' or N[-1] == '1' or N[-1] == '6' or N[-1] == '8':
    car = 'pon'
else:
    car = 'hon'



print(car)

Buggy submission (verdict: Runtime Error):
N = str(input()) #ここで標準入力

car = ''
if N[-1] == 3:
    car = 'bon'
elif N[-1] == 0 or N[-1] == 1 or N[-1] == 6 or N[-1] == 8
    car = 'pon'

print(car)

Buggy submission (verdict: Runtime Error):
N = str(input()) #ここで標準入力

car = ''
if N[-1] == 3:
    car = 'bon'
elif N[-1] == 0 or N[-1] == 1 or N[-1] == 6 N[-1] == 8
    car = 'pon'

print(car)
Problem p02613 (python)

Fixed submission:
n = int(input())
judge = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}
for _ in range(n):
    i = input()
    judge[i] += 1

for j in judge:
    print(f"{j} x {judge[j]} ")

Buggy submission (verdict: Runtime Error):
n = int(input())
judge = {"AC":0, "WA":0, "TLE":0, "RE":0}
for i in range(n):
  judge[i] += 1

for j in judge:
  print(f"{j} x {judge[j]}")
Problem p02657 (python)

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

Buggy submission (verdict: Runtime Error):
a, b = map(int, input())
print(a * b)
Problem p02664 (python)

Fixed submission:
t = list(map(str, input()))
ans = t[:]

if len(t) == 1:
    if t[0] == "?":
        ans[0] = "D"
else:
    if t[0] == "?":
        if t[1] == "P":
            ans[0] = "D"
        else:
            ans[0] = "P"

    for i in range(1, len(t)-1):
        if t[i] == "?":
            if ans[i - 1] == "P":
                ans[i] = "D"
            else:
                if t[i + 1] == "D" or t[i + 1] == "?":
                    ans[i] = "P"
                else:
                    ans[i] = "D"

    if t[-1] == "?":
        ans[-1] = "D"

print("".join(ans))

Buggy submission (verdict: Runtime Error):
t = list(map(str, input()))
ans = t[:]

if t[0] == "?":
    if t[1] == "P":
        ans[0] = "D"
    else:
        ans[0] = "P"

for i in range(1, len(t)-1):
    if t[i] == "?":
        if t[i - 1] == "P":
            ans[i] = "D"
        else:
            if t[i + 1] == "D" or t[i + 1] == "?":
                ans[i] = "P"
            else:
                ans[i] = "D"

if t[-1] == "?":
    ans[-1] = "D"

print("".join(ans))
Problem p02687 (python)

Fixed submission:
n = str(input())

if n == "ABC":
    print("ARC")
else:
    print("ABC")

Buggy submission (verdict: Runtime Error):
S = input()
if S == ABC:
  print("ARC")
else:
  print("ABC")

Buggy submission (verdict: Runtime Error):
n = int(input())
nn = int(pow(n,1/5)) + 1
p = sorted(range(nn),reverse = True)
for i in p:
    b = pow(n - i, 1/5)
    if float.is_integer(b):
        break

print(i,int(-b))
Problem p02690 (python)

Fixed submission:
from decimal import Decimal
n = int(input())
nn = int(pow(n,1/5)) + 1
for i in range(-200,200):
    cheak = i ** 5 - n
    ans = float(pow(Decimal(abs(cheak)), Decimal("0.2")))

    if type(ans) is float:

        if ans.is_integer():
            if cheak < 0:
                b = -1 * ans
            else:
                b = ans
            print(i,int(b))
            break

Buggy submission (verdict: Runtime Error):
n = int(input())
nn = int(pow(n,1/5)) + 1
for i in range(nn):
    b = pow(i ** 5 - n, 1/5)
    if float.is_integer(b):
        break

print(i,int(-b))

Buggy submission (verdict: Runtime Error):
n = int(input())
nn = int(pow(n,1/5)) + 1
p = sorted(range(nn),reverse = True)
for i in range(nn,0,-1):
    b = pow(n - i, 1/5)
    if float.is_integer(b):
        break

print(i,int(-b))
Problem p02696 (python)

Fixed submission:
import math
a, b, n = map(int, input().split())
 
 
def calc(a, b, n):
    return int(math.floor((a * n)/b) - (a * math.floor(n/b)))
 
if n <= b -1:
  print(calc(a,b,n))
else:
  print(calc(a,b,b-1))

Buggy submission (verdict: Runtime Error):
import math
a, b, n = map(int, input().split())
 
 
def calc(a, b, n):
    return int(math.floor((a * n)/b) - (a * math.floor(n/b)))
 
nn = min(n, b - 1)
print(calc(a, b, nn)
Problem p02719 (python)

Fixed submission:
n,k= map(int,input().split())
if n % k == 0:
    print("0")
elif n < k:
    print(min(n % k,abs(n % k - k)))
else:
    print(min(n % k,abs(n % k - k)))

Buggy submission (verdict: Runtime Error):
n,k= map(int,input().split())
if n < k:
    print(n % k)
else:

    print(k%(abs(n) % abs(k)))