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):


import sys
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))

def resolve():
    N,K=pin()
    A=[*pin()]

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

resolve()

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()))

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

Solution (Python):





import sys
import heapq

def main():
    n, k = map(int, input().split())
    nums = list(map(int, sys.stdin.readline().split()))
    for i in range(n - k):
        if nums[i] < nums[k + i]:
            print("Yes")
        else:
            print("No")
    return

if __name__ == "__main__":
    main()

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

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

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

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

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

Solution (Python):
N, K = [int(i) for i in 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):
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):
    print("Yes") if A[i] < A[i+K] 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())
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

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))

N, K = inm()
A = inl()


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


solve()

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

Solution (Python):
LI = lambda: list(map(int, input().split()))

N, K = LI()
A = LI()


def main():
    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()))
d=1
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()))
answer = 'Yes'
score = 0
for i in range(K):
    score += A[i]

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

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 copy
import random
import bisect 
import fractions 
import math
import sys
import collections
from decimal import Decimal 

mod = 10**9+7
sys.setrecursionlimit(mod) 

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

N, K = LI()
A = LI()

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

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

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

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):
import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  
def LS2(): return list(sys.stdin.readline().rstrip())  

N,K = MI()
A = [0] + LI()

for i in range(K+1,N+1):
    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):
import heapq
t = 1
def max(a,b):
	if a > b:
		return a
	return b
while t > 0:
	t -= 1
	n,k = map(int,input().split())
	
	v = list(map(int,input().strip().split()))[0:n]
	for i in range(k,n):
		if v[i] > v[i-k]:
			print("Yes")
		else:
			print("No")

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

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("Yes")
    else:
        print("No")

Solution (Python):

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

Solution (Python):
b = list(map(int,input().split()))
N = b[0]
K = b[1]
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()))

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

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

Solution (Python):
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
first = 1
X = K
Y = 0
for i in range(K,N):
    P = A[X]
    Q = A[Y]
    if P>Q:
        print("Yes")
    else:
        print("No")
    X+=1
    Y+=1

Solution (Python):
import sys
import math


def input():
    return sys.stdin.readline().rstrip()


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

    for j in range(N-K):
        if A[j+K] - A[j] >0:
            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):
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 'No')

Solution (Python):
N, K = list(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()))

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

Solution (Python):
def main():
    import sys
    sys.setrecursionlimit(10**6)
    input = sys.stdin.readline
    N, K = [int(x) for x in input().strip().split()]
    A = [int(x) for x in input().strip().split()]
    p1, p2 = 0, K
    for i in range(N-K):
        if A[p1] < A[p2]:
            print('Yes')
        else:
            print('No')
        p1 += 1
        p2 += 1

if __name__ == '__main__':
    main()

Solution (Python):

import sys
input = sys.stdin.readline

n, k = map(int, input().split())
a = [int(item) for item in input().split()]

for a1, a2 in zip(a, a[k:]):
    if a1 < a2:
        print("Yes")
    else:
        print("No")

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

for i in range(K, N):
    if s_list[i] > s_list[i-K]:
        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(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 a, b in zip(A, A[K:]):
    if a < b:
        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(n-k):
        if a[i]<a[i+k]:
            print("Yes")
        else:
            print("No")

Solution (Python):
import sys

input = sys.stdin.readline


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

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

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


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

Solution (Python):

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

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

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())
As = list(map(int, input().split()))

anss = []
for i in range(K, N):
    if As[i-K] < As[i]:
        anss.append('Yes')
    else:
        anss.append('No')

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

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

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


'''
Author: andyli
Time: 2020-07-25 19:57:01
'''

import os
from io import BytesIO, IOBase
import sys
import math


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')

    return



BUFSIZE = 1048576


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = 'x' in file.mode or 'r' not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b'\n') + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode('ascii'))
        self.read = lambda: self.buffer.read().decode('ascii')
        self.readline = lambda: self.buffer.readline().decode('ascii')


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
def input(): return sys.stdin.readline().rstrip('\r\n')




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):
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):
import bisect
import copy
import heapq
import math
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
sys.setrecursionlimit(500000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

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
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bisect_left
from bisect import bisect_right
from bisect import insort_left
import itertools
from heapq import heapify
from heapq import heappop
from heapq import heappush
import heapq
from copy import deepcopy
from decimal import Decimal
alf = list("abcdefghijklmnopqrstuvwxyz")
ALF = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")

INF = float("inf")


N,K = map(int,input().split())
ans = 0
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):


import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline

N,K = map(int,input().split())
a = list(map(int,input().split()))
ans = ""
for i in range(N):
    if i < K:
        continue
    if a[i] <= a[i - K]:
        ans += "No"
    else:
        ans += "Yes"
    if i != N-1:
        ans += "\n"
print(ans)

Solution (Python):

import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub


import sys


buff_readline = sys.stdin.readline
readline = sys.stdin.readline

INF = 2**62-1


def read_int():
    return int(buff_readline())


def read_int_n():
    return list(map(int, buff_readline().split()))


def read_float():
    return float(buff_readline())


def read_float_n():
    return list(map(float, buff_readline().split()))


def read_str():
    return readline().strip()


def read_str_n():
    return readline().strip().split()

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


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N, K, A):
    for i, a in enumerate(A[K:]):
        if A[i] < a:
            print('Yes')
        else:
            print('No')


def main():
    N, K = read_int_n()
    A = read_int_n()
    (slv(N, K, A))


if __name__ == '__main__':
    main()

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

for i in range(n-k):
  
  if lst[i] < lst[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(K, N):
    prev = A[i-K]
    new = A[i]
    if prev < new:  
        print('Yes')
    else:
        print('No')

Solution (Python):



import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

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

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

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
from collections import defaultdict, Counter, namedtuple, deque
import itertools
import functools
import bisect
import heapq
import math
import copy


MOD = 10 ** 9 + 7



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())
lst=list(map(int,input().split()))
for i in range(k,n):
    if lst[i]>lst[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):
import sys
import math
import itertools
import bisect
from copy import copy,deepcopy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(map(int,input().split()))
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

N,K = I()
A = l()
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]>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 = [int(x) for x in input().split()]
A = [int(x) for x in 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 = [int(i) for i in input().split()]
a = [int(i) for i 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())
A = list(map(int, input().split()))

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

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

def solve():
    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("Yes")
        else:
            print("No")


solve()

Solution (Python):
f=lambda:[*map(int,input().split())]
n,k=f()
ｌ=f()
for i in range(n-k):
  print('YNeos'[l[i]>=l[i+k]::2])

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(N: int, K: int, A: "List[int]"):
    ans = []
    for a0, a1 in zip(A, A[K:]):
        ans.append(YES if a0 < a1 else NO)
    return ans


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    A = [int(next(tokens)) for _ in range(N)]  
    print(*solve(N, K, A), sep="\n")

def test():
    import doctest
    doctest.testmod()

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())
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
import math
import collections
import decimal
import itertools
from collections import deque
from functools import reduce
import heapq
import copy

n, k = map(int, sys.stdin.readline().split())

a = list(map(int, sys.stdin.readline().split()))

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

Solution (Python):


import sys
import numpy as np
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

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

    for i in range(k, n):
        if inlis[i-k]< inlis[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(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(n-k):
    print("Yes" if A[i+k]-A[i]>0 else "No")

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

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

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

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

Solution (Python):
def main():
    from sys import setrecursionlimit, stdin, stderr
    from os import environ
    from collections import defaultdict, deque, Counter
    from math import ceil, floor
    from itertools import accumulate, combinations, combinations_with_replacement
    setrecursionlimit(10**6)
    dbg = (lambda *something: stderr.write("\033[92m{}\033[0m".format(str(something)+'\n'))) if 'TERM_PROGRAM' in environ else lambda *x: 0
    input = lambda: stdin.readline().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    P = 10**9+7
    INF = 10**18+10

    N,K = LMIIS()
    A = LMIIS()
    out = []
    for i in range(K,N):
        if A[i-K] < A[i]:
            out.append('Yes')
        else:
            out.append('No')
    print('\n'.join(out))



    
main()

Solution (Python):
import sys
range = xrange
input = raw_input

n, k = [int(x) for x in input().split()]
A = [int(x) for x 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())
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 bisect
import sys
import math
from collections import deque
from heapq import heappush, heappop

def sRaw():
    return input().rstrip("\r")


def iRaw():
    return int(input())


def ssRaw():
    return input().split()


def isRaw():
    return list(map(int, ssRaw()))


INF = 1 << 29

DIV = (10**9) + 7


def mod_inv_prime(a, mod=DIV):
    return pow(a, mod-2, mod)


def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


def CONV_TBL(max, mod=DIV):
    fac, finv, inv = [0]*max, [0]*max, [0]*max
    fac[0] = fac[1] = 1
    finv[0] = finv[1] = 1
    inv[1] = 1
    for i in range(2, max):
        fac[i] = fac[i-1]*i % mod
        inv[i] = mod - inv[mod % i] * (mod//i) % mod
        finv[i] = finv[i-1]*inv[i] % mod

    class CONV:
        def __init__(self):
            self.fac = fac
            self.finv = finv
            pass

        def ncr(self, n, k):
            if(n < k):
                return 0
            if(n < 0 or k < 0):
                return 0
            return fac[n]*(finv[k]*finv[n-k] % DIV) % DIV

    return CONV()


def cumsum(As):
    s = 0
    for a in As:
        s += a
        yield s


sys.setrecursionlimit(200005)


def dijkstra(G,start=0):
    heap = []
    cost = [INF]*len(G)
    heappush(heap,(0,start))
    while len(heap)!=0:
        c,n = heappop(heap)
        if cost[n] !=INF:
            continue
        cost[n]=c
        for e in G[n]:
            ec,v = e
            if cost[v]!=INF:
                continue
            heappush(heap,(ec+c,v))
    return cost


def main():
    N,K = isRaw()
    As = isRaw()
    for k in range(K,N):
        if As[k]>As[k-K]:
            print("Yes")
        else:
            print("No")
main()

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

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

Solution (Python):
n, k = [int(_) for _ in input().split()]
a = [int(_) for _ in 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 ai, aj in zip(a, a[k:]):
    if ai < aj:
        print('Yes')
    else:
        print('No')