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 = 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
from math import factorial

MOD = 10 ** 9 + 7
INF = float('inf')

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

for i in range(K, N):
    r = i - K
    l = i
    if A[r] >= A[l]:
        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=list(map(int, input().split()))
A=list(map(int, input().split()))
ans=[None]*(N-K)
for i in range(N-K):
  if A[K+i]>A[i]:
    ans[i]='Yes'
  else:
    ans[i]='No'
print(*ans, sep='\n')

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

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

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

Solution (Python):
N, K = map(int, input().split())
A = list(map(int, input().split()))
ACC = []
ACC.append(0)
sum = 0
for a in A:
    sum += a
    ACC.append(sum)


L = N-K+1
prev = ACC[K] - ACC[0]
for i in range(1, L):
    score = ACC[i+K] - ACC[i] 
    if prev < score:
        print("Yes")
    else:
        print("No")
    prev = score

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

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

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

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

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

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

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

for i in range(n-k):
    nuke= A[i] 
    hairu= A[k+i] 
    print("YNeos"[nuke>=hairu::2])

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

evals = []
cnt = 0

for i in range(k, n, 1):
    edge = scores[cnt]
    new_edge = scores[i]
    if edge < new_edge:
        print('Yes')
    else:
        print('No')
    cnt += 1

Solution (Python):
import numpy as np


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

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

"""
・書き始める前に式変形等考える
・判定分を吟味する。（実際の数、今回でいうと積、で比較しない）
"""

Solution (Python):
n, k = map(int, input().split())
a = [int(s) for s 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())
lis = list(map(int, input().split()))
lis_score = []


for i in range(n):

  if i >= k:
    lis_edge_right = lis[i]
    lis_edge_left = lis[i-k]
    
    if lis_edge_right > lis_edge_left:
      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):
a,b = map(int,(input().split()))
c = list(map(int,input().split()))
for i in range(a-b):
    print("Yes" if c[i] < c[i+b] 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 math





e1,e2 = map(int,input().split())
f = list(map(int,input().split()))

cal=1
for i in range(e1-e2):
    if f[i]>=f[i+e2]:
        print("No")
    else:
        print("Yes")

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

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



if __name__ == '__main__':
    main()

Solution (Python):
N , K = list(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(k, n):
    if a[i-k] < a[i]:
        print('Yes')
    else:
        print('No')

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

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

score = sum(A[:K])

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
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):
import sys
def input(): return sys.stdin.readline().rstrip()
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()))
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(1, n - k + 1):
    print("Yes" if l[i - 1] < l[i + k - 1] else "No")

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

for i in range(K+1, N+1):
    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()))

R=[0]*(n+1)
for i in range(1,n+1):
  R[i]=R[i-1]+A[i-1]

for i in range(1,n-k+1):
  if R[k+i]-R[i]>R[k+i-1]-R[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+1, n+1):
    i -= 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()))

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

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

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

Solution (Python):

import sys


def main():
    N,K = list(map(int, sys.stdin.readline().split()))
    A_list = list(map(int, sys.stdin.readline().split()))
    

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
INF = 10**18
def li():
    return [int(x) for x in input().split()]

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

Solution (Python):
N, K = map(int, input().split())
*A, = map(int, 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(k,n):
    if a[i]>a[i-k]:
        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(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())
As = list(map(int, input().split()))

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

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

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

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

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

Solution (Python):
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

from math import log10

n,k=nm()
a=nl()
b=[1]*(n+1)

for i in range(n):
  b[i+1] = log10(a[i])+b[i]

for i in range(n-k):
  if b[i+k+1]-b[i+1] > b[i+k]-b[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 = input().split()
scores = [int(s) for s in input().split()]

N = int(N)
K = int(K)

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

Solution (Python):
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])>1:
        ans.append("Yes")
    else:
        ans.append("No")

for i in range(len(ans)):
    print(ans[i])

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

idx = K-1

while(idx < N-1):
  idx += 1
  if A[idx] / A[idx-K] > 1:
    print("Yes")
  else:
    print("No")

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

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

f_point = sum(a_nums[:k])
for i in range(n - k):
  if a_nums[i] < a_nums[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):
    ab = a[i]
    aa = a[k+i]
    if aa > ab:
        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):
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 inputlist(): return [int(j) for j in input().split()]

N,K = inputlist()
A = inputlist()
A = [0]+A
for i in range(1,N-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()))
ans = []
for i in range(k,n):
  ans.append(a[i] - a[i-k])
for j in ans:
  if j > 0:
    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):

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

if __name__ == '__main__':
    input = sys.stdin.readline
    N, K = map(int, input().split())
    *A, = map(int, input().split())
    main(N, K, A)

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

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

Solution (Python):
from sys import stdin, stdout 
n,k=map(int,input().split())
a=[int(o) for o in input().split()]
prod=1
for i in range(k,n):
    prev=a[i-k]
    if a[i]>prev: stdout.write("Yes\n")
    else: stdout.write("No\n")

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

from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


def LIR(n):
    return [LI() for i in range(n)]


def SR(n):
    return [S() for i in range(n)]


def LSR(n):
    return [LS() for i in range(n)]


sys.setrecursionlimit(1000000)
mod = 1000000007


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



if __name__ == "__main__":
    solve()

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]>A[i-K]:
        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(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()))
for i in range(k-1,n-1):
  if int(a[i-k+1]) < int(a[i+1]):
    print("Yes")
    i+=1
  elif int(a[i-k+1])>=int(a[i+1]):
    print("No")
    i+=1

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

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

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):
from sys import stdin, stdout
import math,sys,heapq
from itertools import permutations, combinations
from collections import defaultdict,deque,OrderedDict
from os import path
import bisect as bi
def yes():print('YES')
def no():print('NO')
if (path.exists('input.txt')): 
    
    sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');
    def I():return (int(input()))
    def In():return(map(int,input().split()))
else:
    
    def I():return (int(stdin.readline()))
    def In():return(map(int,stdin.readline().split()))

def dict(a):
    d={}
    for x in a:
        if d.get(x,-1)!=-1:
            d[x]+=1
        else:
            d[x]=1
    return d

def find_gt(a, x):
    'Find leftmost value greater than x'
    i = bi.bisect_right(a, x)
    if i != len(a):
        return i
    else:            
        return -1

def main():
    try:
        n,k=In()
        l=list(In())   
        ans=[]
        t=1
        last=1
        for x in range(k,n):
            if l[x-k]>=l[x]:
                print('No')
            else:
                print('Yes')


    except:
        pass
        
M = 998244353
P = 1000000007
 
if __name__ == '__main__':
    
    for _ in range(1):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):
n,k=map(int,input().split())
a=list(map(int,input().split()))
ans=["No","Yes"]
for i in range(n-k):
    print(ans[a[i]<a[i+k]])

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

cnt = 0

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):
    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(0,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):
	str = 'Yes'
	if a[i]<=a[i-k]:	
		str = 'No'
	print(str)

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


N, K = [int(_) for _ in stdin.readline().rstrip().split()]
L = [int(_) for _ in stdin.readline().rstrip().split()]

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

Solution (Python):
from sys import stdin
N, K = [int(_) for _ in stdin.readline().rstrip().split()]
L = [int(_) for _ in stdin.readline().rstrip().split()]
for i in range(K+1, N+1):
	if L[i-K-1] < L[i-1]:
		print("Yes")
	else:
		print("No")

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

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

    ans = []
    for i in range(K, N):
        cond = A[i] > A[i - K]
        ans.append('Yes' if cond else 'No')

    print(*ans, sep='\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 - 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(n-k):
    if a[i] < a[i+k] :
        print('Yes')
    else :
        print('No')

Solution (Python):
import copy


def get_int():
    return int(input())


def get_string():
    return input()


def get_int_list():
    return [int(x) for x in input().split()]


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


def get_int_multi():  
    return map(int, input().split())


def get_string_char_list():
    return list(str(input()))





'''
while (idx < n) and ():

    idx += 1
'''

def main():
    n, k = get_int_multi()
    a_list = get_int_list()

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




if __name__ == '__main__':
    main()

Solution (Python):
def main():
    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")
if __name__=='__main__':
    main()

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

def main():
    mod=10**9+7
    N,K=MI()
    A=LI()
    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)

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

Solution (Python):

import sys
sys.setrecursionlimit(10**6)
INF = 10 ** 9 + 1  
MOD = 10 ** 9 + 7


def debug(*x):
    print(*x, file=sys.stderr)


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


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



T1 = """
5 3
96 98 95 100 20
"""
TEST_T1 = """
>>> as_input(T1)
>>> main()
Yes
No
"""

T3 = """
15 7
3 1 4 1 5 9 2 6 5 3 5 8 9 7 9
"""
TEST_T3 = """
>>> as_input(T3)
>>> main()
Yes
Yes
No
Yes
Yes
No
Yes
Yes
"""


def _test():
    import doctest
    doctest.testmod()
    g = globals()
    for k in sorted(g):
        if k.startswith("TEST_"):
            doctest.run_docstring_examples(g[k], g)


def as_input(s):
    "use in test, use given string as input file"
    import io
    f = io.StringIO(s.strip())
    g = globals()
    g["input"] = lambda: bytes(f.readline(), "ascii")
    g["read"] = lambda: bytes(f.read(), "ascii")


input = sys.stdin.buffer.readline
read = sys.stdin.buffer.read

if sys.argv[-1] == "-t":
    print("testing")
    _test()
    sys.exit()

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):
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
sys.setrecursionlimit(10**8)
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):
N, K = map(int, input().split())
A = list(map(int, input().split()))

for i in range(N):
    if i < K:
        continue

    if A[i-K] < A[i]:
        print('Yes')
    else:
        print('No')

Solution (Python):


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


cumulative_sum = 1
for i in range(K):
    cumulative_sum += a_nums[i]
cumulative_list = [0] * N
cumulative_list[K-1] = cumulative_sum


for i in range(K, N):
    cumulative_sum = cumulative_sum - a_nums[i-K]
    cumulative_sum = cumulative_sum + a_nums[i]
    cumulative_list[i] = cumulative_sum
    if cumulative_list[i]>cumulative_list[i-1]:
        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):
    print("Yes" if a[i] > a[i - k] else "No")

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