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):
def main():
    N, K = map(int, input().split())
    A = list(map(int, input().split()))
    div_i = 0
    for i in range(N):
        if i <= K - 1:
            pass
        else:
            if A[i] > A[div_i]:
                print("Yes")
            else:
                print("No")
            div_i += 1


if __name__ == '__main__':
    main()

Solution (Python):
import sys
import numpy as np

readline = sys.stdin.readline
read = sys.stdin.read

n, k = map(int, input().split())
a = np.array(readline().split(), dtype=np.int64)
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 idx in range(k, n):
    small = idx - k
    large = idx
    if A[small] < A[large]:
        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):
from collections import deque, Counter, defaultdict
from itertools import chain, combinations
import json

import bisect
import sys
import math
import bisect
from functools import lru_cache
import itertools

sys.setrecursionlimit(10 ** 8)

M = 10 ** 9 + 7
INF = 10 ** 17


def main():
    N, K = [int(a) for a in input().split()]
    A = [int(a) for a in input().split()]
    
    
    

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


if __name__ == "__main__":
    main()

Solution (Python):
from collections import deque

n, k = map(int, input().split())
a = list(map(int, input().split()))
queue = deque()
for i in range(n):
    if i <= k - 1:
        queue.append(a[i])
    elif i >= k:
        x = queue.popleft()
        if x < a[i]:
            print("Yes")
        else:
            print("No")
        queue.append(a[i])

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

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

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

Solution (Python):

import sys, re
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx):   return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
    temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))
    toret = {}
    for tup in temp:
        toret[tup[0]] = tup[1]
    return toret
def sortDictWithKey(passedDic):
    return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

n,k = MAP()

a = LIST()

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[0+i] < a[k+i] :
        print("Yes")
    else :
        print("No")

Solution (Python):
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')

Solution (Python):
import sys
sys.setrecursionlimit(10**6)


def main(input, print):
    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')


if __name__ == '__main__':
    main(sys.stdin.readline, print)

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

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

Solution (Python):
import math
import collections
import bisect
from collections import deque
from copy import copy, deepcopy


def main():
    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")


if __name__ == '__main__':
    main()

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

for p,n in zip(a, a[k:]):
    if p < n:
        print('Yes')
    else:
        print('No')

Solution (Python):
n, k, *a = map(int, open(0).read().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(K + 1, N + 1):
    if A[i - K - 1] < 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):
    print('Yes' if A[i+k] > A[i] else 'No')

Solution (Python):
from sys import stdin, stdout
import heapq
import cProfile
from collections import Counter, defaultdict, deque
from functools import reduce
import math
import string

def get_int():
    return int(stdin.readline().strip())


def get_tuple():
    return map(int, stdin.readline().split())


def get_list():
    return list(map(int, stdin.readline().split()))

n,k = get_tuple()
ls = get_list()
j = 0
i = k
while i<n:
    if ls[j]>=ls[i]:
        print("No")
    else:
        print("Yes")
    i += 1
    j += 1

Solution (Python):
N, K = map(int, input().split())
A = []
for i, a in enumerate(list(map(int, input().split()))):
  if i < K:
    A.append(a)
    continue
  else:
    A.append(a)
    x = A.pop(0)
    if x < a:
      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(n-k):
    if a[i] < a[i+k]:
        print("Yes")
    else:
        print("No")

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


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

Solution (Python):
N,K = map(int,input().split())
A = list(map(int,input().split()))
val = 1
for i in range(N):
    if i < K:
        continue
    else:
        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()))
ans = [0] * (N)
temp = 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())
l=list(map(int,input().split()))
for i in range(k,n):
    if l[i-k]<l[i]:
        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]: ans = "Yes"
    else: ans = "No"
    print(ans)

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

now = a[0]
idx = 0
gabbege = a[idx]
length = 1
for i in range(1, n):
    if length < k:
        length += 1
        now += a[i]
    else:
        if now < now - gabbege + a[i]:
            print("Yes")
        else:
            print("No")
        now = now - gabbege + a[i]
        idx += 1
        gabbege = a[idx]

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

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

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

if __name__ == "__main__":
    resolve()

Solution (Python):
n, k = map(int, input().split())
a = list(map(int, input().split()))
l = a[:k-1]
for i in range(n-k):
    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[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):
def main():
    n,k = map(int,input().split())
    a = list(map(int,input().split()))

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

if __name__=='__main__':
    main()

Solution (Python):

import math
import bisect
import copy
import time
from collections import Counter


n,k=map(int,input().split())
l=[int(x) for x in input().split()]
x=[]
for i in range(n-k):
	if l[i]<l[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):



def solve(*args: str) -> str:
    n, k = map(int, args[0].split())
    A = list(map(int, args[1].split()))

    ret = ['Yes' if A[i-k] < A[i] else 'No' for i in range(k, n)]
    return '\n'.join(ret)


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

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):
from decimal import Decimal
n, k = map(int, input().split())
A = tuple(map(int, input().split()))

pa = Decimal(1)



for kk in range(k, n):
    ppa = pa*A[kk]/A[kk-k]
    if ppa > pa:
        print('Yes')
    else:
        print('No')
    pa = ppa

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;input = sys.stdin.readline
inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()]

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

Solution (Python):
n,k = map(int, input().split())
la = list(map(int, input().split()))
for i in range(n-k):
  print('Yes' if la[i+k] > la[i] else '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('No')
    else:
        print('Yes')

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

final = []
for i in range(1, n+1):
    if i <= k:
        final.append("Yes")
        continue
    j = i - k
    if(a[i-1]/a[j-1] > 1):
        final.append("Yes")
    else:
        final.append("No")
    

for i in range(k, n):
    print(final[i])

Solution (Python):
a,b=map(int,input().split())
c=list(map(int,input().split()))
result=[]
for i in range(a-b):
    if c[i+b]>c[i]:
        result.append('Yes')
    else:
        result.append('No')
for i in result:
    print(i)

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):
def resolve():
    n,k = list(map(int, input().split()))
    A = list(map(int, input().split()))

    for i in range(0, n-k):
        pre = A[i]
        curr = A[i+k]
        if curr > pre:
            print("Yes")
        else:
            print("No")

resolve()

Solution (Python):
x=input()
x0=x.split()
n=int(x0[0])
k=int(x0[1])
x=input()
x0=x.split()
a=[int(n) for n in x0]
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())
line = list(map(int, input().split()))


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

Solution (Python):
n,k=map(int, input().split())
a=list(map(int, input().split()))
for x in range(k,n):
    if a[x]>a[x-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):
n, k = map(int, input().split())
a = list(map(int, (input().split())))
b = a[:n-k]
c = a[k:]
for i in range(n-k):
    if b[i]<c[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()))

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(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[K+i] > A[i]:
        print('Yes')
    else:
        print('No')

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

score = 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(n-k):
    if a[i] < a[i+k]:
        print("Yes")
    else:
        print("No")

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

k -= 1

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

Solution (Python):
n,k = map(int , raw_input().split())
ais = map(int, raw_input().split())
for ii in range(k, n):
	print 'Yes' if ais[ii] > ais[ii - k] else 'No'

Solution (Python):
n, k = map(int, input().split())
a = list(map(int, input().split()))
"""
point = 1
points = []

for i in range(n):
    point *= a[i]
    if i >= k - 1:
        points.append(point)
        if i >= k:
            if points[-1] > points[-2]:
                print("Yes")
            else:
                print("No")
        point //= a[i - k + 1]
"""
for i in range(n):
    if i >= 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, j in zip(a, a[k:]):
  print("Yes" if i < j else "No")

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

for i in range(k, n):
  print('Yes' if a[i] > a[i-k] else '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 = [int(hoge) for hoge in input().split()]
A = [1] + [int(hoge) for hoge in input().split()]
ZeroIndex = [n for n,m in enumerate(A) if m==0]
Zeronum = []
curz = 0
for n,a in enumerate(A):
    if a==0:
        curz += 1
    Zeronum.append(curz)

for gakki in range(K+1,N+1):
    
    
    
    if Zeronum[gakki-1] > Zeronum[gakki-K]:
        print("No")
    elif A[gakki] > A[gakki-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()))


cnt = 0
bi = 0

for i in range(k, n):
    bi = a[cnt]
    if bi < a[i]:
        print("Yes")
    else:
        print("No")
    cnt += 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("Yes")
    else:
        print("No")

Solution (Python):

import sys
input = sys.stdin.readline

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
n, k = MI()
mylist = LI()

for i in range(n-k):
    last = mylist[i]
    update = mylist[k+i]
    if update > last:
        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=list(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):
def LI():
  return list(map(int,input().split()))
  
n,k=LI()
a=LI()

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):
    print("Yes")if a[k+i]>a[i] else print("No")

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

    t = 1
    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()))

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] > 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):
    tmp=a[i]
    tmp1=a[i+k]
    if tmp1>tmp:
        print("Yes")
    else:
        print("No")

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

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

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

Solution (Python):




import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    n,k=map(int, readline().rstrip().split())
    arr=list(map(int, readline().rstrip().split()))
    
    score=1
    for i in range(n):
        
        if (i+1) > k:
            
            if arr[i] > arr[i-k]:
                print("Yes")
            else:
                print("No")
        

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

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

Solution (Python):
def main():
    
    N_all, K_part = map(int, input().split())
    scores = list(map(int, input().split()))

    init = 1

    for i in range(N_all - K_part):
        index = i + K_part
        after = scores[index]
        before = scores[i]
        
        if (before < after):
            print('Yes')
        else:
            print('No')
        
if __name__ == '__main__':
    main()

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

Solution (Python):
import numpy as np

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

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

for ii in np.arange(k+1-1,n):
	if a[ii]>a[ii-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):
def listseki(A,start,end):
    ans=A[end]/A[start-1]
    return ans
N,K=map(int,input().split())
A=list(map(int,input().split()))
for i in range(1,N-K+1):
    nowseki=listseki(A,i,i+K-1)
    if nowseki>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):
    print('Yes' if A[i]>A[i-K] else 'No')

Solution (Python):
n, k = map(int, input().split())
a_list = list(map(int, input().split()))
for i in range(k, n):
    if a_list[i-k] < a_list[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):
    if i >= K:
        if A_LIST[i] > A_LIST[i - 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(k, n):
        if a[i-k] < a[i]:
            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(N-K):
    if A[i] < A[i+K]:
        print('Yes')
    else:
        print('No')

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

Solution (Python):
import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


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


if __name__ == '__main__':
    main()

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

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

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(N-K):
    if A[i+K]>A[i]:
        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(K,N):
        if A[i] > A[i-K]:
            print('Yes')
        else:
            print('No')


if __name__ == "__main__":
    main()

Solution (Python):


import math

import itertools
from collections import deque
from collections import Counter

from fractions  import gcd

import bisect
n,k=map(int,input().split())
a=list(map(int,input().split()))
check=[0]*n
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()))

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

Solution (Python):

def main():
    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")

if __name__=="__main__":
    main()

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


p1=0
p2=k

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

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

*arr, = map(int, input().split())

ans = []
for i in range(k, len(arr)):
    if arr[i - k] < arr[i]:
        ans.append("Yes")
    else:
        ans.append("No")

print('\n'.join(ans))

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

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

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

for i in range(K, N):
    x = A[i] / A[i-K]
    if x > 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 - k] < 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 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(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(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(N-K):
    if A[i] < A[i+K]:
        print("Yes")
    else:
        print("No")

Solution (Python):
n,k=map(int,input().split())
a = input().split(" ")
lista = [int(n) for n in a]
for i in range(n-k):
  if lista[i]<lista[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, len(a)):
    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('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):
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[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[-(N-K)+i]):
        print("Yes")
    else:
        print("No")

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

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

Solution (Python):
from collections import deque
N,K = map(int,input().split(" "))
q = deque()
line = input().split(" ")
for i in range(K):
  q.append(int(line[i]))
for i in range(K,N):
  x = q.popleft()
  y = int(line[i])
  if x < y:
    print("Yes")
  else:
    print("No")
  q.append(y)

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

for i in range(1,n-k+1):
    if a[k - 1 + i] > 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(map(int, input().split()))

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

Solution (Python):
def main():
    n, k = [int(v) for v in input().split(' ')]
    lst_a = [int(v) for v in input().split(' ')]

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


if __name__ == '__main__':
    main()