PLEASE HELP!!!

I don't know what is the problem with my code. In the first subset all the test casespasses except one. Can someone please look at my python code and modify it.

Thank you

import sys
n,x,y=map(int,input().split())
contests=[]
for i in range(n):
    contests.append(list(map(int,input().split())))
contests=sorted(contests, key=lambda x: x[0])
v=sorted(list(map(int,input().split())))
w=sorted(list(map(int,input().split())))
time=sys.maxsize
for i in contests:
    for j in range(x-1,-1,-1):
        if v[j]<=i[0]:
            t1=v[j]
            break
    for k in range(y):

Below is my code for this problem using python.

from collections import Counter
n1,n2,n3=map(int,input().split())
VList=[]
for i in range(n1+n2+n3):
    VList.append(int(input()))
VList=Counter(VList).items()
newList=[]
for x in VList:
    if x[1]>1:
        newList.append(x[0])
newList=sorted(newList)
print(len(newList))
for i in newList:
    print(i)

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

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

command=tuple(map(int,input().split()))

i=0

crane=0

for c in command:

if c==0:

break

elif c==1:

if i>0:

i-=1

elif c==2:

if i<n-1: