Problem:
 Score: 300 points    Problem Statement  M-kun is a student in Aoki High School, where a year is divided into N terms. There is an exam at the end of each term. According to the scores in those exams, a student is given a grade for each term, as follows:   For the first through (K-1) -th terms: not given.  For each of the K -th through N -th terms: the multiplication of the scores in the last K exams, including the exam in the graded term.   M-kun scored A_i in the exam at the end of the i -th term. For each i such that K+1 \leq i \leq N , determine whether his grade for the i -th term is strictly greater than the grade for the (i-1) -th term.      Constraints   2 \leq N \leq 200000  1 \leq K \leq N-1  1 \leq A_i \leq 10^{9}  All values in input are integers.         Input  Input is given from Standard Input in the following format:  N  K  A_1  A_2  A_3  \ldots  A_N       Output  Print the answer in N-K lines. The i -th line should contain Yes if the grade for the (K+i) -th term is greater than the grade for the (K+i-1) -th term, and No otherwise.        Sample Input 1 5 3
96 98 95 100 20      Sample Output 1 Yes
No  His grade for each term is computed as follows:   3 -rd term: (96 \times 98 \times 95) = 893760  4 -th term: (98 \times 95 \times 100) = 931000  5 -th term: (95 \times 100 \times 20) = 190000        Sample Input 2 3 2
1001 869120 1001      Sample Output 2 No  Note that the output should be No if the grade for the 3 -rd term is equal to the grade for the 2 -nd term.       Sample Input 3 15 7
3 1 4 1 5 9 2 6 5 3 5 8 9 7 9      Sample Output 3 Yes
Yes
No
Yes
Yes
No
Yes
Yes

Solution (Python):
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
res = 0
for i in range(n-k):
  if a[i+k] - a[i] > 0:
    print("Yes")
  else:
    print("No")

Solution (Python):
N, K = map(int, input().split())
A = [int(i) for i in input().split()]

for k in range(K, N):
    if A[k] > A[k-K]:
        print("Yes")
    else:
        print("No")

Solution (Python):
N, K = map(int, input().split())
A = list(map(int, input().split()))
for i in range(K, N):
    if A[i-K] < A[i]:
        print("Yes")
    else:
        print("No")

Solution (Python):
n, k = map(int, input().split())
a = list(map(int, input().split()))

for i in range(n - k):
    if a[k+i] > a[i]:
        print("Yes")
    else:
        print("No")

Solution (Python):
N, K = map(int, input().split())
A = [int(a) for a in input().split()]

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

Solution (Python):
n,k = map(int,input().split())
score = list(map(int,input().split()))
for i in range(n-k):
  if score[i] >= score[k+i]:
    print('No')
  else:
    print('Yes')

Solution (Python):
import sys
n,k = map(int, input().split())
A = list(map(int, input().split()))

for i in range(k, n):
    if A[i] > A[i-k]:
        print('Yes')
    else:
        print('No')

Solution (Python):
N,K = map(int, input().strip().split())
A = list(map(int, input().strip().split()))

text=""
for i in range(K,N):
    if A[i]>A[i-K] :
        text+="Yes\n"
    else:
       text+="No\n"
print("{}".format(text))

Solution (Python):
n,k = map(int, input().split())
a = [0]+[int(x) for x in input().split()]
 
def hyouka(gakki):
    if a[gakki-k]<a[gakki]:
        print("Yes")
    else:
        print("No")

for i in range(k+1,n+1):
    hyouka(i)

Solution (Python):
N, K = map(int,input().split())
A = list(map(int,input().split()))

for i in range(N - K):
    if A[K - K + i] >= A[K + i]:
        print('No')
    else:
        print('Yes')

Solution (Python):

N,K = list(map(int, input().split()))
A_list = list(map(int, input().split()))

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

Solution (Python):
def main():
    N, K = map(int, input().split())
    A = [int(i) for i in input().split()]

    for i in range(K, N):
        if A[i] > A[i - K]:
            print("Yes")
        else:
            print("No")


if __name__ == '__main__':
    main()

Solution (Python):
N,K = map(int, input().split())
A=list(map(int, input().split()))
j = 0
for i in range(K,N):
    if A[j] < A[i]:
        print("Yes")
    else:
        print("No")
    j += 1

Solution (Python):
n,k = map(int, input().split())
a = list(map(int, input().split()))

nums = [0]*n
nums[k-1] = sum(a[:k])
for i in range(k,n):
  nums[i] = nums[i-1] + a[i] - a[i-k]

for i in range(k,n):
  if nums[i-1] < nums[i]: print("Yes")
  else: print("No")

Solution (Python):
N,K=map(int,input().split())
a_list=list(map(int,input().split()))
for i in range(N-K):
    if a_list[i] <a_list[i+K]:
        print("Yes")
    else:
        print("No")

Solution (Python):
N, K = map(int, input().split())
A_list = input().split()
A_list = [int(x) for x in A_list]

for i in range(N-K):
    if(A_list[i] < A_list[i + K]):
        print('Yes')
    else:
        print('No')

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def TUPLE(): return tuple(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7 





def main():
	N, K = MAP()
	A = LIST()

	for i in range(K, N):
		if A[i-K] < A[i]:
			print("Yes")
		else:
			print("No")

if __name__ == '__main__':
	main()

Solution (Python):
def main():
    n,k = map(int, input().split())
    a = list(map(int, input().split()))
    for i in range(n-k):
        print("Yes" if a[i] < a[i+k] else "No")

if __name__ == '__main__':
    main()

Solution (Python):
n, k = map(int, input().split(' '))
list_a = list(map(int, input().split(' ')))

for i in range(k, n):
  if list_a[i] > list_a[i-k]:
    print('Yes')
  else:
    print('No')

Solution (Python):
n, k = map(int, input().split())
a_lis = list(map(int, input().split()))
for i in range(k, n):
    if a_lis[i] > a_lis[i-k]:
        print("Yes")
    else:
        print("No")

Solution (Python):
n, k = map(int, input().split())
a = [int(x) for x in input().split()]

ans = sum(a[0:k])
for i in range(1, n-k+1):
    nxt = ans - a[i-1] + a[i+k-1]
    if ans < nxt:
        print('Yes')
    else:
        print('No')
    ans = nxt

Solution (Python):
N, K = map(int, input().split())
A = list(map(int, input().split()))

for i in range(K-1, N-1):
    if A[i-K+1] >= A[i+1]:
        print("No")
    else:
        print("Yes")

Solution (Python):
n, k=map(int, input().split())
a=[0]+list(map(int, input().split()))

c=1

for i in range(k, n):
    center=a[i]
    left=a[c]
    right=a[i+1]

    if left<right:
        print("Yes")
        c+=1
    else:
        print("No")
        c+=1

Solution (Python):
N,K = (int(i) for i in input().split())  
A = [int(i) for i in input().split()] 

for i in range(K, N):
    if A[i] > A[i-K]:
        print("Yes")
    else:
        print("No")

Solution (Python):
def main():
    n, k = list(map(int, input().split()))
    a = list(map(int, input().split()))

    for i, _a in enumerate(a[k:]):
        if a[i] < _a:
            print("Yes")
        else:
            print("No")
    
    return


if __name__ == "__main__":
    main()

Solution (Python):
n, k = map(int, input().split())
a = list(map(int, input().split()))


for i in range(k, n):
    if a[i-k] < a[i]:
        print("Yes")
    else:
        print("No")

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

n, k, *a = map(int, read().split())

for i in range(k, n):
    if a[i] <= a[i - k]:
        print('No')
    else:
        print('Yes')

Solution (Python):
n, k = map(int, input().split())
a = list(map(int, input().split()))

tmp = a[0]
for i in range(n-k):
    ans = 'Yes' if a[i] < a[i+k] else 'No'
    print(ans)

Solution (Python):
N, K = map(int, input().split())
A = list(map(int, input().split()))

for i in range(K, N):
    if A[i-K] < A[i]:
        print('Yes')
    else:
        print('No')

Solution (Python):
n,k=map(int,input().split())
a=list(map(int,input().split()))
hikaku = a[0]
i = k
t=0
while i <= n - 1:
    if hikaku < a[i]:
        print("Yes")
    else:
        print("No")
    t += 1
    i+=1
    hikaku=a[t]

Solution (Python):
n,k = map(int,input().split())
alist = list(map(int,input().split()))

prev_a = []
for i in range(n):
    prev_a.append(alist[i])
    if i >= k:

        if prev_a.pop(0) < alist[i]:
            print("Yes")
        else:
            print("No")

Solution (Python):
N,K=map(int,input().split())
A=list(map(int,input().split()))
for i in range(N-K):
    print("Yes" if A[i+K]>A[i] else "No")

Solution (Python):
N, K = map(int, input().split())
A = list(map(int, input().split()))
a = K
b = 0
for _ in range(N-K):
    if A[a] > A[b]:
        print('Yes')
    else:
        print('No')
    a += 1
    b += 1

Solution (Python):
N, K = map(int,input().split())
A = list(map(int, input().split()))

for i in range(K,N):
    if A[i] <= A[i - K]:
        print('No')
    else:
        print('Yes')

Solution (Python):
N,K = map(int,input().split())
A = list(map(int,input().split()))

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

Solution (Python):
N, K = map(int, input().split())
A = list(map(int, input().split()))

for i in range(K, N):
    if A[i] > A[i - K]:
        print("Yes")
    else:
        print("No")

Solution (Python):
N, K  = map(int, input().split())
A_list = list(map(int, input().split()))
'''

ans_list = [ 0 for n in range(N)]
tmp = 1
for k in range(K):
    tmp *= A_list[k]
    
ans_list[K-1] = tmp

for k in range(K, N):
    ans_list[k] = ans_list[k-1]//A_list[k-K] * A_list[k]
'''


for k in range(K, N):
    if A_list[k] > A_list[k-K]:
        print('Yes')
    else:
        print('No')

Solution (Python):
from collections import defaultdict
from collections import deque
from collections import Counter
import itertools
import math

def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()

n,k = readInts()
a = readInts()


t = a[0]

for i in range(k,n):
	be = a[i-k]
	af = a[i]
	
	if be>=af:
		print("No")
	else:
		print("Yes")

Solution (Python):
N,K=map(int,input().split())
A=list(map(int,input().split()))

for i in range(N-K) :
    if A[i]<A[i+K] :
        print("Yes")
    elif A[i]>=A[i+K] :
        print("No")

Solution (Python):
N, K = [int(s) for s in input().split()]
A = [int(s) for s in input().split()]

x = 1
for i in range(K, N):
    if A[i] > A[i - K]:
        print('Yes')
    else:
        print('No')

Solution (Python):
n, k = map(int, input().split())
a = list(map(int, input().split()))

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

Solution (Python):
n, k = map(int, input().split())
a = list(map(int, input().split()))





for i in range(1,n-k+1):
    if a[i+k-1]/a[i-1]>1:
        print("Yes")
    else:
        print("No")

Solution (Python):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
import random
from collections import deque
from decimal import *
import queue

input = sys.stdin.readline

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]

inf = float('inf')
mod = 1000000007




def main():
	N,K = inputMap()
	A = inputList()

	ans = 1
	ans_old = 1
	mae = 0
	for i,val in enumerate(A):
		if i < K:
			continue
		tmp = A[i-K]
		if val > tmp:
			print("Yes")
		else:
			print("No")





if __name__ == "__main__":
	main()

Solution (Python):
N, K = map(int, input().split())
A = list(map(int, input().split()))

for j in range(K, N):
    if A[j] > A[j-K]:
        print('Yes')
    else:
        print('No')

Solution (Python):
def main():
    n, k= map(int, input().split())
    a = list(map(int, input().split()))

    for i in range(1, n-k+1):
        if a[i - 1] < a[k+ i -1]:
            print('Yes')
        else:
            print('No')
            
    
if __name__ == '__main__':
    main()

Solution (Python):
n,k = list(map(int,input().split()))

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

for i in range(k, n):
    if a[i]>a[i-k]:
        print('Yes')
    else:
        print("No")

Solution (Python):
n, k = map(int, input().split())
A = list(map(int, input().split()))











for i in range(k, n):
    if A[i] > A[i - k]:
        print('Yes')
    else:
        print('No')

Solution (Python):
N, K = map(int, input().split())

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







i = 0

for k in range(K, N):
    if A[i] < A[k]:
        print("Yes")
    else:
        print("No")
    i += 1

Solution (Python):
N, K = map(int, input().split())
list_A = list(map(int, input().split()))

for i in range(N - K):
    if list_A[i] < list_A[i + K]:
        print("Yes")
    else:
        print("No")

Solution (Python):
N, K = map(int, input().split())
A = list(map(int, input().split()))
for i in range(N-K):
  if A[i] < A[i+K]:
    print('Yes')
  else:
    print('No')

Solution (Python):
n, k = map(int, input().split())
a = list(map(int, input().split()))

for i in range(n - k):
    if a[i] < a[i + k] :
        print("Yes")
    else:
        print("No")

Solution (Python):
n, k = map(int, input().split())
a = list(map(int, input().split()))

for i in range(k, n):
    if a[i-k] < a[i]:
        print('Yes')
    else:
        print('No')

Solution (Python):
N,K =map(int,input().split())
A = list(map(int,input().split()))
for i in range(N-K):
  if A[i] < A[i+K]:
    print("Yes")
  else:
    print("No")

Solution (Python):
n,k=map(int,input().split())
a=list(map(int, input().split()))

results = [0]*(n+1)
for i in range(n-k):
  if a[i] < a[i+k]:
    results[i+k+1] = 'Yes'
  else:
    results[i+k+1] = 'No'

for i in range(k+1,n+1):
  print(results[i])

Solution (Python):
import math 

N, K = map(int, input().split())
scores = list(map(int, input().split()))
l = []
for i in range(N - K):
  print("Yes") if scores[i] < scores[i + K] else print("No")

for i in l:
  print(i)

Solution (Python):
if __name__ == '__main__':
    n,k = map(int, input().split())
    a = [int(i) for i in input().split()]

    for i in range(n-k):
        if a[i] < a[i+k]:
            print("Yes")
        else:
            print("No")

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

def main():
    N, K, *A = map(int, read().split())
    for i in range(N-K):
        if A[i] < A[K+i]:
            print('Yes')
        else:
            print('No')
    return

if __name__ == '__main__':
    main()

Solution (Python):
n,k=map(int, input().split())
A=list(map(int, input().split()))


for gakki in range(k+1,n+1):
    
    pre = A[gakki-k-1]
    
    
        

    
    
    k_gakki = A[gakki-1]
    
    
    
        
    
    
    if pre < k_gakki:
        print('Yes')
    else:
        print('No')

Solution (Python):
n, k = map(int, input().split())
a = [int(i) for i in input().split()]

for i in range(k, n):
    if a[i - k] < a[i]:
        print("Yes")
    else:
        print("No")

Solution (Python):
n, k = map(int, input().split())
li = list(map(int, input().split()))

for i in range(n-k):
    if li[i] >= li[i+k]:
        print("No")
    else:
        print("Yes")

Solution (Python):
n, k = map(int, input().split())
a = list(map(int, input().split()))

for i in range(n - k):
    if a[i] < a[i + k]:
        print('Yes')
    else:
        print('No')

Solution (Python):
def main():
    N, K = list(map(int, input().split()))
    A = list(map(int, input().split()))

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

if __name__ == '__main__':
    main()

Solution (Python):
N,K = map(int,input().split())
A = list(map(int, input().split()))
temp_1 = 1 
temp_2 = 1 

for i in range(N):
    if i>(K-1):
        if A[i-K]<A[i]:
            print('Yes')
        else:
            print('No')

Solution (Python):
N, K = map(int,input().split())
A = list(map(int,input().split()))

K -= 1
for i in range(K,N-1):
    if A[i-K] < A[i+1]:
        print('Yes')
    else:
        print('No')

Solution (Python):
n,k = map(int,input().split())
a = list(map(int,input().split()))


for i in range(n-k):
    if a[i] < a[k+i]:
        print('Yes')
    else:
        print('No')

Solution (Python):
N,K = map(int, input().split())

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

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

Solution (Python):
from copy import deepcopy
import numpy as np


nk = input().split()
n = int(nk[0])
k = int(nk[1])
ajs = input().split()
ajs = np.log([int(aj) for aj in ajs])
ajs = ajs / ajs.max()

ak_current = ajs[:k].cumsum()[-1]

for i in range(k, n):
  ak_tmp = deepcopy(ak_current)

  ak_tmp =  ak_tmp - (ajs[i-k]) + (ajs[i])
  
  if ak_tmp > ak_current:
    print('Yes')
  else:
    print('No')
    
  ak_current = ak_tmp

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")

n, k = map(int, input().split())
a = [int(x) for x in input().split()]
a_start = a[0]
a_last = a[k - 1]
for i in range(1, n - k + 1):
    next_start = a[i]
    next_last = a[k + i - 1]
    if next_last > a_start:
        print('Yes')
    else:
        print('No')
    a_start, a_last = next_start, next_last

Solution (Python):
n,k = map(int,input().split())
a = list(map(int,input().split()))

for i in range(n-k):
    if a[i] < a[k+i]:
        print('Yes')
    else:
        print('No')

Solution (Python):
n, k = map(int,input().split())
a = list(map(int,input().split()))
for i in range(n-k):
    if a[i] < a[i+k]:
        print("Yes")
    else:
        print("No")

Solution (Python):
N, K = map(int, input().split())
A = list(map(int,input().split()))

i = 0

while i+K<N:
  if A[i]<A[K+i]:
    print('Yes')
    i += 1
  else:
    print('No')
    i += 1

Solution (Python):
N, K= map(int,input().split())
A = list(map(int,input().split()))

for i in range(K+1, N+1):
    if A[i-1]>A[i-K-1]:
        print('Yes')
    else:
        print('No')

Solution (Python):
n,k=map(int,input().split())
a=list(map(int,input().split()))



for i in range(n-k):

    if a[i]<a[i+k]:
        print("Yes")
    else:
        print("No")

Solution (Python):
n,k = map(int,input().split())
a = list(map(int,input().split()))

for i in range(n-k):
    if a[k+i] > a[i]:
        print("Yes")
    else:
        print("No")

Solution (Python):
import math

def main():
    N,K=map(int,input().split())
    A=list(map(int,input().split()))

    left=A[0]

    left_index=0
    right_index=K-1

    for i in range(1,N-K+1):
        left_index+=1
        right_index+=1
        right=A[right_index]
        if left<right:
            print("Yes")
        else:
            print("No")
        left=A[left_index]


if __name__=="__main__":
    main()

Solution (Python):
N,K=map(int,input().split())
A=list(map(int,input().split()))


tmp=1
before_score=0
for i in range(K,N):
  if i>=K-1:
    if i>=K:
      print('Yes' if A[i-K]<A[i] else 'No')

Solution (Python):
N,K=map(int, input().split())
a_ls=list(map(int, input().split()))


for i in range(K+1,N+1):
	if a_ls[i-1]>a_ls[i-K-1]:
		print("Yes")
	else:
		print("No")

Solution (Python):
n, k = (int(each) for each in input().split())
a = [int(each) for each in input().split()]
for i in range(n-k):
    if a[i] < a[k+i]:
        print('Yes')
    else:
        print('No')

Solution (Python):
import sys
import copy
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
INF = 1000000000000

n,k = LI()
a = LI()

for i in range(n):
    if(i >= k):
        if(a[i] > a[i-k]):
            print('Yes')
        else:
            print('No')

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

n,k = inpl()
a = inpl()
for i,x in enumerate(a):
    if i < k:
        continue
    else:
        if x > a[i-k]:
            print('Yes')
        else:
            print('No')

Solution (Python):
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def exit(*argv, **kwarg):
    print(*argv, **kwarg)
    sys.exit()


def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))



def a_int(): return int(read())


def ints(): return list(map(int, read().split()))


def read_col(H):
    '''H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) 
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_tuple(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_matrix(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    


MOD = 10**9 + 7
INF = 2**31  

from collections import defaultdict, Counter, deque
from operator import itemgetter, xor, add
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  
from functools import reduce


N, K = ints()
A = ints()
ans = []
for i in range(N):
    if i + K == N:
        break
    if A[i] < A[i + K]:
        ans.append('Yes')
    else:
        ans.append('No')
print(*ans, sep='\n')

Solution (Python):
n, k = map(int, input().split())
a = list(map(int, input().split()))


for i in range(n-k):
    
    if a[k+i] > a[i]:
        print("Yes")
    else:
        print("No")

Solution (Python):
N,K = (int(X) for X in input().split())
A = [int(X) for X in input().split()]
for T in range(0,N-K):
    if A[T]<A[T+K]:
        print('Yes')
    else:
        print('No')

Solution (Python):

n,k=map(int,input().split())
l=list(map(int,input().split()))
mul=1
for i in range(k):
  mul=mul+l[i]
z=mul
j=0
for i in range(k,n):
  z=z-l[j]
  z=z+l[i]
  if z>mul:
    print('Yes')
  else:
    print('No')
  j+=1
  mul=z

Solution (Python):
n,k=map(int,input().split())
a=list(map(int,input().split()))


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

Solution (Python):
n, k = map(int, input().split())
a_list = list(map(int, input().split()))

for i in range(n - k):
    if a_list[i] < a_list[i + k]:
        print("Yes")
    else:
        print("No")

Solution (Python):
if __name__ == "__main__":
    N, K = map(int, input().split())
    A = list(map(int, input().split()))

    for i in range(K, len(A)):
        if A[i-K] < A[i]:
            print("Yes")
        else:
            print("No")

Solution (Python):
if __name__ == '__main__':
    n, k = map(int, input().split())
    a = list(map(int, input().split()))

    for i in range(len(a) - k):
        if a[i] < a[i+k]:
            print("Yes")
        else:
            print("No")

Solution (Python):
n, k = map(int, input().split())
a = list(map(int, input().split()))

for i in range(n - k):
    if a[i] < a[i + k]:
        print("Yes")
    else:
        print("No")

Solution (Python):
num=input().split(" ")
num1=list(map(int, input().split()))
N=int(num[0])
K=int(num[1])
for i in range(N-K):
    if num1[i]<num1[i+K]:
        print("Yes")
    else:
        print("No")

Solution (Python):
n,k = map(int,input().split())
alis = list(map(int,input().split()))

for i in range(n-k):
    if(alis[i]<alis[i+k]):
        print('Yes')
    else:
        print('No')

Solution (Python):
from collections import deque

N, K = map(int, input().split())
A = [*map(int, input().split())]

K_pts = deque(A[:K])
for i in range(K, N):
  print("Yes" if A[i] > K_pts.popleft() else "No")
  K_pts.append(A[i])

Solution (Python):
n,k = map(int,input().split())
a = list(map(int,input().split()))

for i in range(n-k):
    if a[i]>=a[i+k]:
        print("No")
    else:
        print("Yes")

Solution (Python):
n, k = map(int, input().split())
a = list(map(int, input().split()))

for i in range(k, n):
    prev = a[i - k]
    next = a[i]
    if next > prev:
        print('Yes')
    else:
        print('No')

Solution (Python):
n,k = map(int,input().split())
A = list(map(int,input().split()))

for i in range(n-k):
    if A[i]<A[i+k]:
        print('Yes')
    else:
        print('No')

Solution (Python):
import math
n , k = map(int , input().split())
arr = list(map(int , input().split()))
tot=0
for i in range(0 , k):
	tot = tot + (math.log2(arr[i]))
j = 0
for i in range(k , n):
	now = tot + math.log2(arr[i])
	now = now-math.log2(arr[j])
	j=j+1
	if now>tot:
		print("Yes")
	else:
		print("No")

Solution (Python):
import numpy as np
n, k = map(int, input().split())
points = list(map(int, input().split()))

base = 1
for i, point in enumerate(points[k:]):
  if point>points[i]:
    print('Yes')
  else:
    print('No')

Solution (Python):
n, k = map(int, input().split())

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


for i in range(n - k):
    if(a[i] < a[k+i]):
        print("Yes")
    else:
        print("No")

Solution (Python):
N,K = map(int,input().split())
A = list(map(int,input().split()))
for i in range(K,N):
    if A[i] > A[i-K]:
        print("Yes")
    else:
        print("No")

Solution (Python):
N, K = map(int, input().split())
A = list(map(int, input().split()))

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

Solution (Python):

import sys
rl = sys.stdin.buffer.readline

N, K = map(int, rl().split())
AS = tuple(map(int, rl().split()))

for i in range(K, N):
  print('Yes' if AS[i-K] < AS[i] else 'No')

Solution (Python):
n,k = map(int,input().split())
a = list(map(int,input().split()))
for i in range(0,n-k):
    if a[i]<a[k+i]:
        print('Yes')
    else:
        print('No')

Solution (Python):
n,k=map(int,input().split())
a=list(map(int,input().split()))

for i in range(n-k):
  if a[i]>=a[i+k]:
    print("No")
    
  else:
    print("Yes")

Solution (Python):
from collections import deque
n,k = map(int,input().split())
l = list(map(int,input().split()))

que = deque(l[:k])
for i in range(n-k):
    p = que.popleft()
    que.append(l[k+i])
    if p < l[k+i]:
        print('Yes')
    else:
        print('No')

Solution (Python):
n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n-k):
    if a[i] < a[i+k]:
        print("Yes")
    else:
        print("No")

Solution (Python):
n, k, *A = map(int, open(0).read().split())
for i in range(k, n):
    if A[i-k] < A[i]:
        print('Yes')
    else:
        print('No')

Solution (Python):
import math
N, K = map(int, input().split())
A = list(map(int, input().split()))

scr = 0
for i in A[:K]:
    scr += math.log10(i)

for i in range(K, N):
    scr_new = scr + math.log10(A[i]) - math.log10(A[i-K])
    if scr_new > scr: print('Yes')
    else: print('No')

Solution (Python):
N, K = map(int, input().split())

A_list = [int(n) for n in input().split()]

import numpy as np

for i in range(N - K):
  judge = A_list[K + i] > A_list[i]
  
  if judge:
    print('Yes')
  else:
    print('No')

Solution (Python):
import sys
import numpy as np
input = sys.stdin.readline


def log(*args):
    print(*args, file=sys.stderr)


def main():
    np.set_printoptions(threshold=20)
    N, K = map(int, input().split())
    A = list(map(int, input().rstrip().split()))
    for i in range(K, N):
        if A[i - K] < A[i]:
            print("Yes")
        else:
            print("No")


if __name__ == '__main__':
    main()

Solution (Python):



N, K = map(int, input().split())
A = list(map(int, input().split()))
for i in range(K,N):
    if A[i]>A[i-K]:
        print('Yes')
    else:
        print('No')

Solution (Python):
import sys
sys.setrecursionlimit(10**7) 
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right

from collections import deque, defaultdict


from collections import Counter

from itertools import accumulate,combinations,permutations,product

from heapq import heapify,heappop,heappush

from functools import reduce,lru_cache

from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def binr(x): return bin(x)[2:]
def bitcount(x): 
    x= x - ((x >> 1) & 0x5555555555555555)
    x= (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
    x= (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f 
    x+= (x >> 8); x+= (x >> 16); x+= (x >> 32) 
    return x & 0x7f

class SWAG:
    def __init__(self,func,ide,A):
        self.A=tuple(deepcopy(A))
        self.ide=ide
        self.func=func
        self.front=self.ide
        self.fr=0
        self.fl=0
        self.back=deque()

    def right(self,step=1):
        for i in range(step):
            self.front=self.func(self.front,self.A[self.fr+i])
        self.fr+=step
    
    def left(self,step=1):
        back=self.back
        func=self.func
        for _ in range(step):
            if not back:
                for i in range(self.fr-1,self.fl-1,-1):
                    x=self.A[i]
                    if back:
                        z=func(x,back[-1])
                    else:
                        z=x
                    back.append(z)
                self.fl=self.fr
                self.front=self.ide
            back.pop()

    def get(self):
        if self.back:
            return self.func(self.back[-1],self.front)
        return self.front



def main():
    mod = 1000000007
    

    
    N, K = map(int, input().split())
    A = tuple(map(int, input().split())) 
    
    

    for i in range(K,N):
        tail=A[i-K]
        head=A[i]
        if head>tail:
            print('Yes')
        else:
            print('No')
        

if __name__ == "__main__":
    main()

Solution (Python):
n,k=map(int,input().split())
a=list(map(int,input().split()))

for i in range(n-k):

    if a[i]<a[k+i]:
        print("Yes")
    else:
        print("No")