Buggy python submission (verdict: Time Limit Exceeded):
N,K = map(int,input().split())
A = list(map(int,input().split()))

b = 1
for i in A[0:K]:
    b *= i
for i in range(N-K):
    a = b/A[i]*A[i+K]
    if b < a :
        print("Yes")
    else:
        print("No")
    b = a


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

result = []
for i in range(K, N):
    if A[i] > A[i - K]:
        result.append('Yes')
    else:
        result.append('No')
print(*result, sep='\n')

Buggy python submission (verdict: Runtime Error):
N,K = map(int,input().split())
A = list(map(int,input().split()))

b = 1
for i in A[0:K]:
    b *= i
for i in range(N-K):
    print(A[i+1])
    a = b/A[i+1]*A[i+3]
    print(a)
    if b < a :
        print("Yes")
    else:
        print("No")
    b = a


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

result = []
for i in range(K, N):
    if A[i] > A[i - K]:
        result.append('Yes')
    else:
        result.append('No')
print(*result, sep='\n')

Buggy python submission (verdict: Time Limit Exceeded):
N,K = map(int,input().split())
A = list(map(int,input().split()))

b = 1
for i in A[0:K]:
    b *= i

for i in range(N-K):
    a = 1
    for i in A[i+1:i+K+1]:
        a *= i
    if b < a :
        print("Yes")
    else:
        print("No")
    b = a


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

result = []
for i in range(K, N):
    if A[i] > A[i - K]:
        result.append('Yes')
    else:
        result.append('No')
print(*result, sep='\n')

Buggy python submission (verdict: Time Limit Exceeded):
N,K = map(int,input().split())
A = list(map(int,input().split()))

be = A[0:K]
b = 1
for i in be:
    b *= i
for i in range(N-K):
    af = A[i+1:i+K+1]
    a = 1
    for i in af:
        a *= i
    if b < a :
        print("Yes")
    else:
        print("No")
    b = a


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

result = []
for i in range(K, N):
    if A[i] > A[i - K]:
        result.append('Yes')
    else:
        result.append('No')
print(*result, sep='\n')

Buggy python submission (verdict: Time Limit Exceeded):
N,K = map(int,input().split())
A = list(map(int,input().split()))
for i in range(N-K):
    be = A[i:i+K]
    af = A[i+1:i+K+1]
    b = 1
    a = 1
    for i in be:
        b *= i
    for i in af:
        a *= i
    if b < a :
        print("Yes")
    else:
        print("No")


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

result = []
for i in range(K, N):
    if A[i] > A[i - K]:
        result.append('Yes')
    else:
        result.append('No')
print(*result, sep='\n')

Buggy python submission (verdict: Time Limit Exceeded):
N,K = map(int,input().split())
A = list(map(int,input().split()))

for i in range(N-K):
    be = A[i:i+K]
    af = A[i+1:i+K+1]
    if sum(be) < sum(af) :
        print("Yes")
    else:
        print("No")


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

result = []
for i in range(K, N):
    if A[i] > A[i - K]:
        result.append('Yes')
    else:
        result.append('No')
print(*result, sep='\n')