ZhenlongDai/ACPR huggingface dataset:
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k, q = map(int, input().split())
a = [ int(input()) for i in range(q) ]

for i in range(1,n+1):
    x = a.count(i)
    if k-q+x > 0:
        print('YES')
    else:
        print('NO')

Failing test case input:
6 0 4
3
2
6
4

Expected output:
No
No
No
No
No
No


Actual output:
NO
NO
NO
NO
NO
NO


Fixed submission (verdict: Accepted):
n, k, q = map(int, input().split())
a = [ int(input()) for i in range(q) ]
score = [k-q]*n
for i in a:
    score[i-1] += 1
for i in score:
    print('Yes' if i > 0 else 'No')

Problem: p02911
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n,k,q = map(int,input().split())
a = [int(input()) for A in range(q)]
ans = [k]*(n+1)
for i in range(1,q):
	ans[a[i-1]] += 1
for j in range(1,n+1):
	ans[j] -= q
ans.pop(0)
for h in range(n):
	print("Yes" if ans[h] > 0 else "No")

Failing test case input:
21 1 1
3
0
1
4

Expected output:
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
n,k,q = map(int,input().split())
a = [int(input()) for A in range(q)]
ans = [k]*(n+1)
for i in range(1,q+1):
	ans[a[i-1]] += 1
for j in range(1,n+1):
	ans[j] -= q
ans.pop(0)
for h in range(n):
	print("Yes" if ans[h] > 0 else "No")

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
sin = input()
n, k, q = map(int, sin.split())

sei = [0] * n
for i in range(q):
    sei[int(input()) -1] += 1

print(sei)
for ss in sei:
    if k + ss - q > 0:
        print('Yes')
    else:
        print('No')

Failing test case input:
47 11 15
3
1
8
1
3
0
3
3
3
6
8
13
0
0
0

Expected output:
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
[2, 0, 5, 0, 0, 1, 0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4]
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
sin = input()
n, k, q = map(int, sin.split())

sei = [0] * n
for i in range(q):
    sei[int(input()) -1] += 1

for ss in sei:
    if k + ss - q > 0:
        print('Yes')
    else:
        print('No')
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q = map(int, list(input().split()))
point=[k]*n
a=[]

for i in range(n):
	point[i]-=1
for i in range(q):
	a.append(int(input()))
	point[a[i]-1]+=1
max=max(point)
for i in range(n):
    if point[i]==max or k-q>0:
        print("Yes")
    else:
        print("No")

Failing test case input:
37 8 9
3
1
6
1
5
0
1
6
5
7
9
16
1
0
13

Expected output:
Yes
No
No
No
Yes
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
n,k,q = map(int, list(input().split()))
point=[k]*n
a=[]
	
for i in range(q):
	a.append(int(input()))
	point[a[i]-1]+=1
for i in range(n):
    if point[i]-q>0:
        print("Yes")
    else:
        print("No")

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q =map(int, input().split())
a = [int(input()) for _ in range(q)]
score = [k-q]*n
print(len(a))
for i in range(q):
    temp = a[i]-1
    score[temp] =  score[temp] + 1
for i in range(n):
    if score[i] > 0:
        print('Yes')
    else:
        print('No')


Failing test case input:
49 8 3
4
0
4
2
7
0
2
12
1
6
13
8
1
7
13

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
3
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Fixed submission (verdict: Accepted):
n,k,q =map(int, input().split())
a = [int(input()) for _ in range(q)]
score = [k-q]*n
for i in range(q):
    temp = a[i]-1
    score[temp] =  score[temp] + 1
for i in range(n):
    if score[i] > 0:
        print('Yes')
    else:
        print('No')

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def resolve():
    N, K, Q = map(int, input().split())
    A = [Q-K]*N
    for _ in range(Q):
        a = int(input())
        A[a-1] += 1
    for i in range(N):
        if A[i] > 0:
            print("Yes")
        else:
            print("No")
resolve()

Failing test case input:
37 16 15
3
1
8
1
9
0
2
6
5
6
5
13
1
1
0

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
Yes
No
No
No
Yes
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
Yes


Fixed submission (verdict: Accepted):
def resolve():
    N, K, Q = map(int, input().split())
    A = [K-Q]*N
    for _ in range(Q):
        a = int(input())
        A[a-1] += 1
    for i in range(N):
        if A[i] > 0:
            print("Yes")
        else:
            print("No")
resolve()
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k, q = map(int, input().split())

member = [k - q] * n
for i in [int(input(x)) for x in range(q)]:
    member[i-1] += 1

for i in member:
    if i > 0:
        print('Yes')
    else:
        print('No')


Failing test case input:
37 8 15
3
0
8
1
5
0
2
6
5
6
5
8
1
0
13

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
01234567891011121314No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
n, k, q = map(int, input().split())

point = [k - q] * n
for i in range(q):
    point[int(input())-1] += 1

for i in point:
    if i <= 0:
        print('No')
    else:
        print('Yes')

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q = map(int, list(input().split()))
point=[k]*n
a=[]
	
for i in range(q):
	a.append(int(input()))
	point[a[i]-1]+=1
max=max(point)
for i in range(n):
    if point[i]==max or point[i]-q>0:
        print("Yes")
    else:
        print("No")

Failing test case input:
6 1 4
3
2
6
4

Expected output:
No
No
No
No
No
No


Actual output:
No
Yes
Yes
Yes
No
Yes


Fixed submission (verdict: Accepted):
n,k,q = map(int, list(input().split()))
point=[k]*n
a=[]
	
for i in range(q):
	a.append(int(input()))
	point[a[i]-1]+=1
for i in range(n):
    if point[i]-q>0:
        print("Yes")
    else:
        print("No")

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k, q = map(int, input().split())

res = [0]*n

for _ in range(q):
    res[int(input()) - 1] += 1

print(res)
for i in res:
    if i <= q - k:
        print("No")
    else:
        print("Yes")


Failing test case input:
10 8 3
6
0
8
1
2
-1
2
6
0
10
5
8
1
7
1

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
[0, 0, 0, 0, 0, 1, 0, 1, 0, 1]
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Fixed submission (verdict: Accepted):
n, k, q = map(int, input().split())

res = [0]*n

for _ in range(q):
    res[int(input()) - 1] += 1

for i in res:
    if i <= q - k:
        print("No")
    else:
        print("Yes")
Problem: p02911
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
import sys
input = sys.stdin.readline
n,k,q=map(int,input().split())
point=[0]*n
for a in range(q):
    a=int(input())
    point[a-1]+=1
print(point)
for i in point:
    if i>q-k:
        print("Yes")
    else:
        print("No")


Failing test case input:
37 8 15
3
0
8
1
5
0
2
6
5
6
5
8
1
0
13

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
[2, 1, 1, 0, 3, 2, 0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3]
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
import sys
input = sys.stdin.readline
n,k,q=map(int,input().split())
point=[0]*n
for a in range(q):
    a=int(input())
    point[a-1]+=1

for i in point:
    if i>q-k:
        print("Yes")
    else:
        print("No")

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import collections
n, k, q = map(int, input().split())
A = [int(input()) for _ in range(q)]
a_c = collections.Counter(A)
x = ['No'] * n
for i,j in a_c.items():
  if j > q-k:
    x[i-1] = 'Yes'
for k in x:
	print(k)

Failing test case input:
15 1 0
6
1
5
4

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
import collections
n, k, q = map(int, input().split())
A = [int(input()) for _ in range(q)]
a_c = collections.Counter(A)
cnt = 0
x = ['No'] * n
if q-k < 0:
	for a in range(n):
		print('Yes')
	exit()
for i,j in a_c.items():
  if j > q-k:
    x[i-1] = 'Yes'
for k in x:
	print(k)

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys

num = input().split()
participant = int(num[0])
init_point = int(num[1])
correct = int(num[2])

tmp = [0]*participant

for i in range(correct):
  answer_person = int(input())-1
  tmp[answer_person] += 1
print(tmp)

for i in tmp:
  if i<=correct-init_point:
    print("No")
  else:
    print("Yes")

Failing test case input:
6 1 4
2
2
6
4

Expected output:
No
No
No
No
No
No


Actual output:
[0, 2, 0, 1, 0, 1]
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
import sys

num = input().split()
participant = int(num[0])
init_point = int(num[1])
correct = int(num[2])

tmp = [0]*participant

for i in range(correct):
  answer_person = int(input())-1
  tmp[answer_person] += 1

for i in tmp:
  if i<=correct-init_point:
    print("No")
  else:
    print("Yes")
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,K,Q=list(map(int,input().split()))
L=[K for _ in range(N)]
a=[int(input()) for _ in range(Q)]

for i in a:
    L[i-1]=L[i-1]+1

for i in range(len(L)):
    if Q<L[i]:
        print("YES")
    else:
        print("NO")

Failing test case input:
17 1 0
2
2
0
2

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES


Fixed submission (verdict: Accepted):
n, k, q = map(int, input().split())
L = [k for i in range(n)]
a = [int(input()) for i in range(q)]

for i in a:
    L[i-1] = L[i-1] + 1

for i in range(len(L)):
    if q  < L[i]:
        print("Yes")
    else:
        print("No")

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q =map(int,input().split())
ans=[0]*n
for i in range(q):
    a=int(input())
    ans[a-1]+=1
for i in range(n):
    if ans[i]<=q-k and q-k>0:
        print("No")
    else:
        print("Yes")


Failing test case input:
31 0 0
-1
2
1
4

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Fixed submission (verdict: Accepted):
n,k,q =map(int,input().split())
ans=[0]*n
for i in range(q):
    a=int(input())
    ans[a-1]+=1
for i in range(n):
    if ans[i]<=q-k and q-k>=0:
        print("No")
    else:
        print("Yes")

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,K,Q=map(int,input().split())
P=[K-Q]*N
P[0]=P[0]-1
for i in range(Q):
    A=int(input())
    P[A-1]=P[A-1]+1
for i in range(N):
    if P[i]>0:
        print('Yes')
    else:
        print('No')

Failing test case input:
15 1 0
6
1
5
4

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Fixed submission (verdict: Accepted):
N,K,Q=map(int,input().split())
P=[K-Q]*N
for i in range(Q):
    A=int(input())
    P[A-1]=P[A-1]+1
for i in range(N):
    if P[i]>0:
        print('Yes')
    else:
        print('No')

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k, q = map(int, input().split())
 
members_p = [3 for _ in range(n)]
 
for _ in range(q):
  a = int(input())
  for i in range(n):
    if i != a-1:
      members_p[i] -= 1
  
result = ['Yes' if member_p > 0 else 'No' for member_p in members_p]
print(*result, sep = '\n')

Failing test case input:
6 2 2
6
1
4
2

Expected output:
Yes
No
No
No
No
Yes


Actual output:
Yes
Yes
Yes
Yes
Yes
Yes


Fixed submission (verdict: Accepted):
n, k, q = map(int, input().split())

members_p = list(k-q for _ in range(n))
a_list = []

for _ in range(q):
  a_list.append(int(input()))
  
for i in range(q):
  target_index = a_list[i]-1
  members_p[target_index] += 1

res = ['Yes' if member > 0 else 'No' for member in members_p]  
  
print(*res, sep = '\n')
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q=map(int,input().split())
life=[k-q]*n
for i in range(q):
    tem=int(input())
    life[tem-1]+=1
for j in life:
    print('YNEOS'[j<=0::2])

Failing test case input:
10 8 3
6
0
8
1
2
-1
2
6
0
10
5
8
1
7
1

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES


Fixed submission (verdict: Accepted):
n,k,q=map(int,input().split())
life=[k-q]*n
for i in range(q):
    tem=int(input())
    life[tem-1]+=1
for j in life:
    if j <=0:
        print('No')
    else:
        print('Yes')

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q=map(int,input().split())
if k>q:
    for i in range(n):
        print("Yes")
        exit()
ans=[k-q for i in range(n)]
for i in range(q):
    ans[int(input())-1]+=1
for i in range(n):
    if ans[i]>0:
        print("Yes")
    else:
        print("No")

Failing test case input:
27 8 4
3
1
4
2
5
0
2
6
5
6
9
8
1
7
13

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
Yes


Fixed submission (verdict: Accepted):
n,k,q=map(int,input().split())




ans=[k-q for i in range(n)]
for i in range(q):
    ans[int(input())-1]+=1
for i in range(n):
    if ans[i]>0:
        print("Yes")
    else:
        print("No")

Problem: p02911
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N,K,Q =map(int,input().split())
M = [K-Q]*N

for q in range(Q):
  a = int(input())
  M[a-1]+=1
  
print(M)

for m in M:
  if m<=0:
    print("No")
  else:
    print("Yes")

Failing test case input:
2 0 0
4
0
-1
2

Expected output:
No
No


Actual output:
[0, 0]
No
No


Fixed submission (verdict: Accepted):
N,K,Q =map(int,input().split())
M = [K-Q]*N

for q in range(Q):
  a = int(input())
  M[a-1]+=1

for m in M:
  if m<=0:
    print("No")
  else:
    print("Yes")

Problem: p02911
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N, K, Q = map(int,input().split())
a = []
for i in range(Q):
    A = int(input())
    a.append(A)
if K > Q:
    for i in range(N):
        print('Yes')
for i in range(1,N + 1):
    if Q - K + 1 <= a.count(i):
        print('Yes')
    else:
        print('No')

Failing test case input:
10 8 3
6
0
8
1
2
-1
2
6
0
10
5
8
1
7
1

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Fixed submission (verdict: Accepted):
N, K, Q = map(int,input().split())
a = []
b = [0] * N
for i in range(Q):
    A = int(input())
    a.append(A)

for i in a:
    b[i - 1] += 1
for i in b:
    if i > Q - K:
        print('Yes')
    else:
        print('No')
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,K,Q = map(int,input().split())
A = []
lst_2 = [0] * N
for i in range(Q):
    A.append(int(input()))
for i in range(Q):
    p = A[i]
    lst_2[p-1] += 1
print(lst_2)
for i in range(N):
    if lst_2[i] > -K+Q:
        print("Yes")
    else:
        print("No")

Failing test case input:
17 1 0
2
2
0
2

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Fixed submission (verdict: Accepted):
N,K,Q = map(int,input().split())
A = []
lst_2 = [0] * N
for i in range(Q):
    A.append(int(input()))
for i in range(Q):
    p = A[i]
    lst_2[p-1] += 1
for i in range(N):
    if lst_2[i] > -K+Q:
        print("Yes")
    else:
        print("No")

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q = map(int, list(input().split()))
a = [int(input()) for i in range(q)]

point=[k]*n
for i in range(q):
	point[a[i]-1]+=1
max=max(point)
for i in range(n):
    if point[i]==max or k-q>=0:
        print("Yes")
    else:
        print("No")


Failing test case input:
6 0 4
3
2
6
4

Expected output:
No
No
No
No
No
No


Actual output:
No
Yes
Yes
Yes
No
Yes


Fixed submission (verdict: Accepted):
n,k,q = map(int, list(input().split()))
point=[k]*n
a=[]
	
for i in range(q):
	a.append(int(input()))
	point[a[i]-1]+=1
for i in range(n):
    if point[i]-q>0:
        print("Yes")
    else:
        print("No")

Problem: p02911
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
N, K ,Q  = map(int, input().split())

points = [K for i in range(N)]
for i in range(Q):
  w = int(input())


  for i in range(N):
    if w - 1!= i:
      points[i] -= 1



for p in points:
  if p >0:
    print("yes")
  else:
    print("No")

Failing test case input:
6 2 2
6
1
4
2

Expected output:
Yes
No
No
No
No
Yes


Actual output:
yes
No
No
No
No
yes


Fixed submission (verdict: Accepted):
N, K, Q = map(int, input().split())
result = {}
for i in range(Q):
    winner = int(input())
    result[winner] = result.get(winner, 0) + 1

for i in range(N):
    if K - (Q - result.get(i + 1, 0)) > 0:
        print("Yes")
    else:
        print("No")

Problem: p02911
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n,k,q = map(int,input().split())
points = [k]*n
for i in range(q):
    winner = int(input())
    for j in range(n):
        points[j] -= 1
    points[winner - 1] += 1
for i in points:
    if i > 0:
        print("YES")
    else:
        print("NO")

Failing test case input:
33 -2 -1
-2
23
0
4

Expected output:
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO


Fixed submission (verdict: Accepted):
n,k,q = map(int,input().split())
points = [k-q]*n
for i in range(q):
    winner = int(input())
    points[winner - 1] += 1
for i in points:
    if i >0:
        print("Yes")
    else:
        print("No")
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
from collections import Counter
n,k,q = map(int, input().split())
a = [int(input()) for _ in range(q)]


ans = ["No"] * n
for key,val in Counter(a).items():
    if val + k - q > 0:
        ans[key-1] = "Yes"

[print(i) for i in ans];

Failing test case input:
4 2 0
12
1
4
4

Expected output:
Yes
Yes
Yes
Yes


Actual output:
No
No
No
No


Fixed submission (verdict: Accepted):
from collections import Counter
n,k,q = map(int, input().split())
a = [int(input()) for _ in range(q)]

if k > q: ans = ["Yes"] * n
else: ans = ["No"] * n

for key,val in Counter(a).items():
    if val + k - q > 0:
        ans[key-1] = "Yes"

[print(i) for i in ans];

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q = map(int,input().split())
a = []
points = []
for i in range(q):
    a.append(int(input()))
print('-------')
for i in range(1,n+1):
    points.append(a.count(i))
tot = sum(points)
tot = -tot
for i in range(n):
    if tot + points[i] + k > 0:
        print('Yes')
    else:
        print('No')

Failing test case input:
17 1 1
3
1
0
2

Expected output:
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
-------
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Fixed submission (verdict: Accepted):
n,k,q = map(int,input().split())
a = {i: 0 for i in range(1,n+1)}
points = []

for i in range(1,q+1):
    x = int(input())
    if x in a:
        a[x] += 1
    else: 
        a[x] = 1

tot = sum(a.values())
tot = -tot

for i in range(1,n+1):
    if tot + a[i] + k > 0:
        print('Yes')
    else:
        print('No')

Problem: p02911
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n, k, q = map(int, input().split())
a = [int(input()) for i in range(q)]

if k >= q:
    print(n)
    exit()

ans = 0
for i in range(1, n + 1):
    if q - a.count(i) < k:
        print('Yes')
    else:
        print('No')


Failing test case input:
17 1 1
2
1
0
1

Expected output:
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No


Actual output:
17


Fixed submission (verdict: Accepted):
n, k, q = map(int, input().split())
k -= q

if k > 0:
    for i in range(n):
        print('Yes')
    exit()

a = [int(input()) for i in range(q)]
n_a = [k] * n

for i in range(q):
    n_a[a[i] - 1] += 1

ans = 0
for i in n_a:
    if i <= 0:
        print('No')
    else:
        print('Yes')

Problem: p02911
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N,K,Q = map(int, input().split())

score = [K-Q]*N

for i in range(Q):
    temp = int(input())
    score[temp-1] += 1

for j in score:
    if j > 0:
        print('YES')
    else:
        print('NO')
    

Failing test case input:
6 3 4
3
1
3
4

Expected output:
No
No
Yes
No
No
No


Actual output:
NO
NO
YES
NO
NO
NO


Fixed submission (verdict: Accepted):
N,K,Q = map(int, input().split())

score = [K-Q]*N

for i in range(Q):
    temp = int(input())
    score[temp-1] += 1

for j in score:
    if j > 0:
        print('Yes')
    else:
        print('No')
Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q = map(int, list(input().split()))
point=[k]*n
a=[]
	
for i in range(q):
	a.append(int(input()))
	point[a[i]-1]+=1
max=max(point)
min=min(point)
for i in range(n):
    if point[i]==max or min-q>0:
        print("Yes")
    else:
        print("No")

Failing test case input:
6 1 4
2
2
6
4

Expected output:
No
No
No
No
No
No


Actual output:
No
Yes
No
No
No
No


Fixed submission (verdict: Accepted):
n,k,q = map(int, list(input().split()))
point=[k]*n
a=[]
	
for i in range(q):
	a.append(int(input()))
	point[a[i]-1]+=1
for i in range(n):
    if point[i]-q>0:
        print("Yes")
    else:
        print("No")

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, K, Q = map(int, input().split(' '))
P = [0 for _ in range(N)]

for i in range(Q):
    a = int(input()) - 1
    P[a] += 1

for i in range(N):
    if K - (Q - P[i]) > 0:
        print('yes')
    else:
        print('No')


Failing test case input:
8 1 1
4
1
0
2

Expected output:
No
No
No
Yes
No
No
No
No


Actual output:
No
No
No
yes
No
No
No
No


Fixed submission (verdict: Accepted):
N, K, Q = map(int, input().split(' '))
P = [0 for _ in range(N)]

for i in range(Q):
    a = int(input()) - 1
    P[a] += 1

for i in range(N):
    if K - (Q - P[i]) > 0:
        print('Yes')
    else:
        print('No')

Problem: p02911
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k,q = map(int,input().split())
a = []
for _ in range(q):
    a.append(int(input()))

point_get = [0] * n
for i in range(q):
    point_get[a[i]-1] += 1

print(point_get)
for j in range(n):
    if k - q + point_get[j] >= 1:
        print('Yes')
    else:
        print('No')


Failing test case input:
9 1 0
6
1
3
4

Expected output:
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Actual output:
[0, 0, 0, 0, 0, 0, 0, 0, 0]
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes


Fixed submission (verdict: Accepted):
n,k,q = map(int,input().split())
a = []
for _ in range(q):
    a.append(int(input()))

point_get = [0] * n
for i in range(q):
    point_get[a[i]-1] += 1

for j in range(n):
    if k - q + point_get[j] >= 1:
        print('Yes')
    else:
        print('No')
Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s=list(map(int,input().split()))
print(max(s)-min(s))

Failing test case input:
8
-2 -1 0 1 3 -90 0 1

Expected output:
93


Actual output:
0


Fixed submission (verdict: Accepted):
input()
s=list(map(int,input().split()))
print(max(s)-min(s))

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a=list(map(int,input().split()))
b=sorted(a)
print(b[-1]-b[0])

Failing test case input:
4
0 4 8 18

Expected output:
18


Actual output:
0


Fixed submission (verdict: Accepted):
z=int(input())
a=list(map(int,input().split()))
b=sorted(a)
print(b[-1]-b[0])

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
l = list(map(int,input().split()))

l_max = max(l)
l_min = min(l)

print(str(l_max - l_min))


Failing test case input:
4
0 -13 -21 -1

Expected output:
21


Actual output:
0


Fixed submission (verdict: Accepted):
N = int(input())
l = list(map(int,input().split()))

l_max = max(l)
l_min = min(l)

print(str(l_max - l_min))

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
l=sorted(map(int,input().split()))
print(l[-1]-l[0])

Failing test case input:
4
4 4 8 9

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):
input()
l=sorted(map(int,input().split()))
print(l[-1]-l[0])

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
s = list(map(int, input().split()))
print(s)
print(max(s) - min(s))

Failing test case input:
8
0 1 0 2 7 8 0 6

Expected output:
8


Actual output:
[0, 1, 0, 2, 7, 8, 0, 6]
8


Fixed submission (verdict: Accepted):
n = int(input())
s = list(map(int, input().split()))
print(max(s) - min(s))

Problem: p03694
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
N = list(map(int, input().split()))
print(max(N)-min(N))

Failing test case input:
4
1 1 80 -1

Expected output:
81


Actual output:
0


Fixed submission (verdict: Accepted):
N = int(input())
X = list(map(int, input().split()))
print(max(X)-min(X))

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
A=list(map(int,input().split()))
A=sorted(A)
print(A[-1]-A[0])


Failing test case input:
8
0 -4 -1 21 -2 -15 4 2

Expected output:
36


Actual output:
0


Fixed submission (verdict: Accepted):
N=int(input())
A=list(map(int,input().split()))
A=sorted(A)
print(A[-1]-A[0])

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = list(map(int,input().split()))
s.sort()
print(s[len(s)-1] - s[0])

Failing test case input:
4
1 1 39 -1

Expected output:
40


Actual output:
0


Fixed submission (verdict: Accepted):
n = int(input())
s = list(map(int,input().split()))
s.sort()

print(s[len(s)-1] - s[0])
Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))
n = ii()
A = list(set(sorted(iil())))
print(A[-1]-A[0])


Failing test case input:
8
9 3 -1 1 -3 3 -13 0

Expected output:
22


Actual output:
-1


Fixed submission (verdict: Accepted):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))
n = ii()
A = set(sorted(iil()))
print(max(A)-min(A))

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
List = list(map(int,input().split()))
print(List[n-1]-List[0])

Failing test case input:
8
-2 -1 0 1 3 -149 0 1

Expected output:
152


Actual output:
3


Fixed submission (verdict: Accepted):
n = int(input())
List = sorted(list(map(int,input().split())))
print(List[n-1]-List[0])

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = list(map(int, input().split()))
print(max(s)-min(s))

Failing test case input:
4
0 -33 -16 -2

Expected output:
33


Actual output:
0


Fixed submission (verdict: Accepted):
n = int(input())
s = list(map(int, input().split()))
print(max(s)-min(s))

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
l=sorted(map(int,input().split()))
print(l[-1]-l[0])

Failing test case input:
4
1 0 1 -28

Expected output:
29


Actual output:
0


Fixed submission (verdict: Accepted):
N=int(input())
l=sorted(map(int,input().split()))
print(l[-1]-l[0])

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
x = sorted(list(map(int, input().split())))

print(max(x)-min(x)+1)

Failing test case input:
8
55 1 -3 -1 -2 0 0 1

Expected output:
58


Actual output:
59


Fixed submission (verdict: Accepted):
n = int(input())
x = sorted(list(map(int, input().split())))

print(max(x)-min(x))

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = sorted((map(int,input().split())))
print(a[-1] - a[0])

Failing test case input:
8
-2 -1 0 1 3 -90 0 1

Expected output:
93


Actual output:
0


Fixed submission (verdict: Accepted):
b = input()
a = sorted((map(int,input().split())))
print(a[-1] - a[0])

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
a = list(map(int, input().split()))
a.sort()
res = 0
for i in range(n - 1):
    res += a[i+1] - a[i]
print(a)


Failing test case input:
4
0 -42 -2 0

Expected output:
42


Actual output:
[-42, -2, 0, 0]


Fixed submission (verdict: Accepted):
n = int(input())
a = list(map(int, input().split()))
a.sort()
res = 0
for i in range(n - 1):
    res += a[i+1] - a[i]
print(res)
Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = input()
A = sorted(list(map(int, input().split())))
print(A[-1] - A[0] + 1)


Failing test case input:
4
0 -13 -21 -1

Expected output:
21


Actual output:
22


Fixed submission (verdict: Accepted):
N = input()
A = sorted(list(map(int, input().split())))
print(A[-1] - A[0])

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9 + 7

n = int(input())
a = list(map(int,input().split()))
ans = 0
for i in a:
    cost = 0
    for j in a:
        d = abs(i-j)
        cost += d
    ans = max(ans,cost)
print(ans)

Failing test case input:
8
3 1 1 1 5 18 1 6

Expected output:
17


Actual output:
108


Fixed submission (verdict: Accepted):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9 + 7

n = int(input())
a = sorted(list(map(int,input().split())))
print(a[-1]-a[0])

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
l=[int(i) for i in input().split()]
print(max(l)-min(l))

Failing test case input:
4
0 -13 -26 -1

Expected output:
26


Actual output:
0


Fixed submission (verdict: Accepted):
input()
l=[int(i) for i in input().split()]
print(max(l)-min(l))

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

n = int(input())
a = list(map(int, input().split()))
new = sorted(a)
print(a[-1] - a[0])

Failing test case input:
4
0 -13 -26 -1

Expected output:
26


Actual output:
-1


Fixed submission (verdict: Accepted):

n = int(input())
a = list(map(int, input().split()))
new = sorted(a)
print(new[-1] - new[0])

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a= input().split(' ')
a = [int(x) for x in a]
mi = min(a)
ma = max(a)
print(int(ma- mi))


Failing test case input:
8
3 1 1 1 5 18 1 6

Expected output:
17


Actual output:
0


Fixed submission (verdict: Accepted):
w =  input()
a= input().split(' ')
a = [int(x) for x in a]
mi = min(a)
ma = max(a)
print(int(ma- mi))

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

a = list(map(int, input().split()))
a.sort()
print(a[-1]-a[0])


Failing test case input:
8
9 3 -1 1 -3 3 -13 0

Expected output:
22


Actual output:
0


Fixed submission (verdict: Accepted):
_ = input()
A = list(map(int,input().split()))
A.sort()
print(A[-1]- A[0])

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = list(map(int, input().split()))
print(max(a) - min(a))

Failing test case input:
8
64 5 0 0 -3 10 0 0

Expected output:
67


Actual output:
0


Fixed submission (verdict: Accepted):
input()
a = list(map(int, input().split()))
print(max(a) - min(a))
Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
a=list(map(int,input().split()))
sa=sorted(a,reverse=True)
total=0
for i in range(1,n):
    total += a[i]-a[i-1]

print(total)

Failing test case input:
8
3 1 4 1 5 18 2 6

Expected output:
17


Actual output:
3


Fixed submission (verdict: Accepted):
n=int(input())
a=list(map(int,input().split()))
sa=sorted(a)
total=0
for i in range(1,n):
    total += sa[i]-sa[i-1]

print(total)

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
a = list(int(i) for i in input().split())

a.sort

print(a[n-1] - a[0])


Failing test case input:
8
-2 -1 0 1 3 -149 0 1

Expected output:
152


Actual output:
3


Fixed submission (verdict: Accepted):
n = int(input())
a = list(int(i) for i in input().split())

a.sort

print(max(a)-min(a))

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = list(sorted(map(int, input().split())))
print(a[-1] - a[0])

Failing test case input:
4
-94 -8 4 -1

Expected output:
98


Actual output:
0


Fixed submission (verdict: Accepted):
N = int(input())
a = list(sorted(map(int, input().split())))
print(a[-1] - a[0])

Problem: p03694
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
N = int(input())
List = list(map(int,input().split()))
sorted(List)
print(List[-1]-List[0])

Failing test case input:
8
-2 1 1 2 3 -158 0 2

Expected output:
161


Actual output:
4


Fixed submission (verdict: Accepted):
N = int(input())
List = list(map(int,input().split()))
LIst = sorted(List)
print(LIst[-1]-LIst[0])

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=int(input())
A_list=list(map(int,input().split()))
print(A_list[N-1]-A_list[0])

Failing test case input:
4
-1 2 11 6

Expected output:
12


Actual output:
7


Fixed submission (verdict: Accepted):
N=int(input())
l=sorted(list(map(int,input().split())))
print(l[N-1]-l[0])

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
x=input().split()
maxX=max(x)
minX=min(x)
print(int(maxX)-int(minX))

Failing test case input:
8
-2 1 0 3 4 -158 1 7

Expected output:
165


Actual output:
0


Fixed submission (verdict: Accepted):
n = int(input())
x= [int(i) for i in input().split()]

maxX=max(x)
minX=min(x)
print(int(maxX)-int(minX))

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
a = list(map(int, input().split()))
a.sort
print(a[len(a)-1]-a[0])

Failing test case input:
4
0 -13 -21 -1

Expected output:
21


Actual output:
-1


Fixed submission (verdict: Accepted):
N = int(input())
a = list(map(int, input().split()))
a.sort()
print(a[len(a)-1] - a[0])

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = list(map(int, input().split()))
print(max(a) - min(a))


Failing test case input:
8
0 -17 0 4 0 -44 1 0

Expected output:
48


Actual output:
0


Fixed submission (verdict: Accepted):
input()
a = list(map(int, input().split()))
print(max(a) - min(a))
Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s=int(input())
a=list(map(int,input().split()))
a.sort
print(abs(a[0]-a[len(a)-1]))

Failing test case input:
4
1 -30 -11 -2

Expected output:
31


Actual output:
3


Fixed submission (verdict: Accepted):
s=int(input())
a=list(map(int,input().split()))
a.sort()
print(abs(a[0]-a[len(a)-1]))

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
lst = [int(i) for i in input().split()]

print(max(lst) - min(lst))

Failing test case input:
8
3 1 4 1 5 9 2 6

Expected output:
8

Actual output:
0


Fixed submission (verdict: Accepted):
_ = input()
lst = [int(i) for i in input().split()]

print(max(lst) - min(lst))

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
l = sorted(map(int, input().split()))
print(l[-1] - l[0])


Failing test case input:
8
9 3 -1 1 -3 3 -13 0

Expected output:
22


Actual output:
0


Fixed submission (verdict: Accepted):
n = int(input())
a = sorted(map(int, input().split()))
 
print(a[-1] - a[0])

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
r = sorted(input().split())
max_i= int(r[len(r)-1])
min_i= int(r[0])
print(max_i - min_i)

Failing test case input:
4
1 1 91 -1

Expected output:
92


Actual output:
0


Fixed submission (verdict: Accepted):
n = input()
r = input().split()
r =list(map(int,r))
max_i= max(r)
min_i= min(r)
print(max_i - min_i)

Problem: p03694
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
a = list(set(map(int, input().split())))
res = 0
for i in range(len(a) - 1):
    res += a[i+1] - a[i]

print(res)


Failing test case input:
4
4 4 8 9

Expected output:
5


Actual output:
-4


Fixed submission (verdict: Accepted):
n = int(input())
a = list(map(int, input().split()))
a.sort()
res = 0
for i in range(n - 1):
    res += a[i+1] - a[i]
print(res)
Problem: p02777
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s,t = map(str,input().split())
a,b = map(int,input().split())
u =map(str,input().split())

if u==s:
  a -=1
else:
  b -=1
  
print(a,b)


Failing test case input:
red bule
7 -2
red

Expected output:
6 -2


Actual output:
7 -3


Fixed submission (verdict: Accepted):
s,t = map(str,input().split())
a,b = map(int,input().split())
u =input()

if u==s:
  a -=1
else:
  b -=1
  
print(a,b)

Problem: p02777
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
[N, T] = list(map(str, input().split()))
[A, B] = list(map(int, input().split()))
U = input()
print(N, T, A, B, U)
if (N == U):
    A -= 1
else:
    B -= 1
print("{} {}".format(A, B))

Failing test case input:
red blue
-1 0
red

Expected output:
-2 0


Actual output:
red blue -1 0 red
-2 0


Fixed submission (verdict: Accepted):
import sys
[N, T] = list(map(str, input().split()))
[A, B] = list(map(int, input().split()))
U = input()
if (N == U):
    A -= 1
else:
    B -= 1
print("{} {}".format(A, B))
sys.stdout.flush

Problem: p02777
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
color = input()

kosuu = input()

trashc = input()

_ = 0

color = color.split()
kosuu = kosuu.split()
trashc = trashc.split()


while True:
  if(trashc[0] == color[_]):
    kosuu[_] = int(kosuu[_]) -1
    break
      
  _= _+1
    
print(kosuu)


Failing test case input:
red tmbe
3 -2
red

Expected output:
2 -2


Actual output:
2, -2

Fixed submission (verdict: Accepted):
color = input()

kosuu = input()

trashc = input()

_ = 0

color = color.split()
kosuu = kosuu.split()
trashc = trashc.split()


while True:
  if(trashc[0] == color[_]):
    kosuu[_] = int(kosuu[_]) -1
    break
      
  _= _+1
    
print(" ".join(map(str, kosuu)))

Problem: p02777
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def main():
    S,T = input().split()
    a,b = map(int,input().split())
    u = input()
    print(a-1,b if S == u else a,b-1)
    return

if __name__ == "__main__":
    main()

Failing test case input:
red bleu
12 1
red

Expected output:
11 1


Actual output:
11 1 0


Fixed submission (verdict: Accepted):
def main():
    S,T = input().split()
    a,b = map(int,input().split())
    u = input()
    if S == u:
        print(a-1,b)
    else:
        print(a,b-1)
    return

if __name__ == "__main__":
    main()

Problem: p02777
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S_T=input("S T:")
A_B=input("A B:")
U=input("U:")
list_S_T=[]
for i in range(len(S_T)):
    if S_T[i]==" ":
        S =S_T[0:i]
        T=S_T[i+1:len(S_T)]
for i in range(len(A_B)):
    if A_B[i]==" ":
        A = int(A_B[0:i])
        B = int(A_B[i+1:len(A_B)])
if S==U:
    A = A-1
elif T==U:
    B = B-1
print(A,B)

Failing test case input:
red bleu
12 -1
red

Expected output:
11 -1


Actual output:
S T:A B:U:11 -1


Fixed submission (verdict: Accepted):
S_T=input()
A_B=input()
U=input()
list_S_T=[]
for i in range(len(S_T)):
    if S_T[i]==" ":
        S =S_T[0:i]
        T=S_T[i+1:len(S_T)]
for i in range(len(A_B)):
    if A_B[i]==" ":
        A = int(A_B[0:i])
        B = int(A_B[i+1:len(A_B)])
if S==U:
    A = A-1
elif T==U:
    B = B-1
print(A,B)
Problem: p02777
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s,t=map(str,input().split())
a,b=map(int,input().split())
q=input()
print(a-1,b if q==s else a,b-1)

Failing test case input:
red alve
6 9
red

Expected output:
5 9


Actual output:
5 9 8


Fixed submission (verdict: Accepted):
s,t=map(str,input().split())
a,b=map(int,input().split())
q=input()
print("{} {}".format(a-1,b) if q==s else "{} {}".format(a,b-1))

Problem: p02777
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S,T = input().split()
A,B = map(int,input().split())
U = input()
print((A-1,B) if S == U else print (A,B-1))

Failing test case input:
red bleu
12 1
red

Expected output:
11 1


Actual output:
(11, 1)


Fixed submission (verdict: Accepted):
S,T = input().split()
A,B = map(int,input().split())
U = input()
print(A-1,B) if S == U else print(A,B-1)

Problem: p02777
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys
s, t = map(str, sys.stdin.readline().split())
a, b = map(int, sys.stdin.readline().split())
u = sys.stdin.readline()
if s == u:
  print(a-1, b)
else:
  print(a, b-1)


Failing test case input:
red elbt
0 -2
red

Expected output:
-1 -2


Actual output:
0 -3


Fixed submission (verdict: Accepted):
import sys
s, t = map(str, sys.stdin.readline().split())
a, b = map(int, sys.stdin.readline().split())
u = sys.stdin.readline().rstrip()
if s == u:
  print(a-1, b)
else:
  print(a, b-1)

Problem: p02777
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
tmp = input().split()
S = tmp[0]
T = tmp[1]
i = list(map(int, input().split()))
A = i[0]
B = i[1]
U = input()

if S == U:
  print(str(A-1) + " " + str(B))
else:
  print(str(B) + " " + str(A))

Failing test case input:
red blue
5 5
blue

Expected output:
5 4

Actual output:
5 5


Fixed submission (verdict: Accepted):
tmp = input().split()
S = tmp[0]
T = tmp[1]
i = list(map(int, input().split()))
A = i[0]
B = i[1]
U = input()

if S == U:
  print(str(A-1) + " " + str(B))
else:
  print(str(A) + " " + str(B-1))

Problem: p02777
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
S, T = input().split()
A, B = map(int, input().split())
U = input()
 
if S == U :
  print(A - 1)
elif T == U :
  print(B - 1)

Failing test case input:
red blue
3 3
red

Expected output:
2 3


Actual output:
2


Fixed submission (verdict: Accepted):
S, T = input().split()
A, B = map(int, input().split())
U = input()
 
if S == U :
  print(str(A - 1) + ' ' + str(B))
elif T == U :
  print(str(A) + ' ' + str(B - 1))

Problem: p02777
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N_dict  = {i:0 for i in list(map(str,input().split()))}
N_List = list(map(int,input().split()))
ct = 0
for i in N_dict.keys():
    N_dict[i] = N_List[0]
    ct += 1

N_dict[str(input())] -= 1
" ".join(list(map(str,N_dict.values())))


Failing test case input:
red laeu
18 1
red

Expected output:
17 1


Actual output:

Fixed submission (verdict: Accepted):
N_dict  = {i:0 for i in list(map(str,input().split()))}
N_List = list(map(int,input().split()))
ct = 0
for i in N_dict.keys():
    N_dict[i] = N_List[ct]
    ct += 1

N_dict[str(input())] -= 1
print(" ".join(list(map(str,N_dict.values()))))
Problem: p02777
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,t = input().split()
a,b = map(int,input().split())
print(a)
u = input()
if u == n:
    print(a-1,b)
else:
    print(a,b-1)

Failing test case input:
red buel
2 -2
red

Expected output:
1 -2


Actual output:
2
1 -2


Fixed submission (verdict: Accepted):
n,t = input().split()
a,b = map(int,input().split())
u = input()
if u == n:
    print(a-1,b)
else:
    print(a,b-1)

Problem: p02777
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
list1 = input()
list1 = list1.split(' ')
list2 = input()
list2 = list2.split(' ')
list3 = input()
S = list1[0]
T = list1[1]
lenS = int(list2[0])
lenT = int(list2[1])
select = list3[0]
if select == S:
    lenS -= 1
elif select == T:
    lenT -= 1
print(lenS,lenT)

Failing test case input:
red blue
3 4
red

Expected output:
2 4

Actual output:
3 4


Fixed submission (verdict: Accepted):
list1 = input()
list2 = input()
list3 = input()
nlist1 = list1.split(' ')
nlist2 = list2.split(' ')
S = nlist1[0]
T = nlist1[1]
lenS = int(nlist2[0])
lenT = int(nlist2[1])
select = list3
if select == S:
    lenS -= 1
elif select == T:
    lenT -= 1
print(lenS,lenT)

Problem: p02777
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def resolve():
    S, T = input().split()
    A, B = map(int, input().split())
    U = input().split()
 
    if S == U:
        A = A - 1
    else:
        B = B - 1
 
    print(A, B)
 
if __name__ == "__main__":
    resolve()

Failing test case input:
red blue
-2 1
red

Expected output:
-3 1


Actual output:
-2 0


Fixed submission (verdict: Accepted):
def resolve():
    S, T = input().split()
    A, B = map(int, input().split())
    U = input()

    if S == U:
        A -= 1
    else:
        B -= 1
 
    print(str(A) + " " + str(B))
 
if __name__ == "__main__":
    resolve()

Problem: p02777
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S, T = input().split()
A, B = map(int, input().split())
if S == input():
  A -=1
else:
  B -=1
print("{0}" "{1}".format(A, B))



Failing test case input:
red blue
3 8
red

Expected output:
2 8


Actual output:
28


Fixed submission (verdict: Accepted):
S, T = input().split()
A, B = map(int, input().split())
if S == input():
    A -= 1
else:
    B -= 1
print("{0} {1}".format(A, B))

Problem: p02777
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
moji = list(map(str,input().split()))
kazu = list(map(int,input().split()))
U = input()
print(kazu[moji.index(U)] -1)

Failing test case input:
red blue
3 3
red

Expected output:
2 3


Actual output:
2


Fixed submission (verdict: Accepted):
moji = list(map(str,input().split()))
kazu = list(map(int,input().split()))
U = input()
kazu[moji.index(U)] -= 1
print(kazu[0],kazu[1])

Problem: p02777
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
S, T = input().split()
A, B = map(int, input().split())
U = input()
print(A-1, B if S==U else A, B-1)

Failing test case input:
red elbt
-2 0
red

Expected output:
-3 0


Actual output:
-3 0 -1


Fixed submission (verdict: Accepted):
S, T = input().split()
A, B = map(int, input().split())
U = input()
print(A-1, B) if S==U else print(A, B-1)