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

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

Solution (Python):
import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array





sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)

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


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N, K = il()
    A = il()

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


if __name__ == '__main__':
    main()

Solution (Python):

"""M-SOLUTIONS プロコンオープン 2020: C - Marks
https://atcoder.jp/contests/m-solutions2020/tasks/m_solutions2020_c
"""


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

    for i in range(0, N-K):
        prev_score = As[i]
        score = As[K + i]
        if prev_score < score:
            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 = list(map(int, input().split(' ')))

marks = list(map(int, input().split(' ')))

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

Solution (Python):

"""M-SOLUTIONS プロコンオープン 2020: C - Marks
https://atcoder.jp/contests/m-solutions2020/tasks/m_solutions2020_c
"""


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

    
    

    
    

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

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

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

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

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

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

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

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

Solution (Python):
def prod(arr):
    s = 0
    for x in arr:
        s += x
    return s


def main():
    N, K = (int(x) for x in input().split(" "))
    A = [int(x) for x in input().split(" ")]
    lastest_score = prod(A[0:K])
    result = ["No"] * (N-K+1)
    for i in range(1, N-K+1):
        current_score = lastest_score - A[i-1] + A[i + K-1]
        if lastest_score < current_score:
            result[i] = "Yes"
        lastest_score = current_score
    [print(x) for x in result[1:]]


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

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

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

Solution (Python):
import sys
import numpy as np
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))

B = 0
s = 1
for i, a in enumerate(A):
    if i >= K:
        B = A[i-K]
        s = a
        if B != 0 and B < s:
            print('Yes')
        elif B != 0 and B >= s:
            print('No')

Solution (Python):
import numpy as np

N,K=map(int, input().split())
A=np.array(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 = list(map(int, input().split()))
rui = [0] * (N + 1)

for i in range(N):
    rui[i + 1] = rui[i] + a[i]

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

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

t = 0
"""for i in range(t, n):
  point = point*a[i]"""
  


for j in range(k, n):
  
  
  if a[j] > a[t]:
    print("Yes")
  else:
    print("No")
  t+=1

Solution (Python):



from fractions import gcd
from itertools import combinations,permutations,accumulate 

from collections import deque,defaultdict,Counter
import decimal
import re












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

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
n,k = readInts()
A = readInts()
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()))
rui = [0] * (N + 1)

for i in range(N):
    rui[i + 1] = rui[i] + a[i]

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

Solution (Python):
terms, graded_terms = input().split(" ")
grade_list = [i for i in input().split(" ")]
x1 = 0
x2 = int(graded_terms)
for i in range(int(terms)-int(graded_terms)):
    if int(grade_list[x2]) > int(grade_list[x1]):
        print("Yes")
    else:
        print("No")
    x1 += 1
    x2 += 1

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

wa = [0]
for i in range(n):
    wa.append(wa[i]+a[i])

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

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

for i in range(N):
    try:
        if A_l[i] < A_l[i+K]:
            print('Yes')
        else:
            print('No')
    except:
        pass

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

Solution (Python):
import functools
import operator

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



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

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


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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
from collections import deque
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
n, k = M()
A = deque(LI())
ans = deque()
for i in range(k, n):
    if A[i] > A[i-k]:
        print('Yes')
    else:
        print('No')

Solution (Python):

import time
time1 = time.time()

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


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



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


time2 = time.time()

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

Solution (Python):






import time

    






mod = int(1e9+7)

INF = 1<<50

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

def main():
    n,k = readInt()
    a = readInt()
    ans = ["Yes\n" for i in range(n-k)]
    for i in range(n):
        if i<k:
            continue
        if a[i]>a[i-k]:
            print("Yes")
        else:
            print("No")
    return

if __name__=='__main__':
    main()

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

for j in range(n-k):
    if x[k+j] > x[j]:
        print('Yes')
    else:
        print('No')

Solution (Python):

n,k=map(int,input().split())
x=[int(x) for x in input().split()]
ans=[1]*n
ans[0]=x[0]
c=0
for i in range(k,n):

  if x[c]<x[i]:
    print('Yes')
  else:print('No')
  c+=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,*l=map(int,open(0).read().split())
for i in range(n-k): print('YNeos'[l[i]>=l[i+k]::2])

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

score = input().split()

for i in range(semester - K + 1) :
    if i == 0 :
        continue    

    if int(score[K - K + i - 1]) < int(score[K - 1 + i]) :
        print("Yes")
    else :
        print("No")

Solution (Python):
import numpy as np

n,k= map(int,input().split())
a = list(map(int,input().split()))
target = a[0:k]
p = sum(target)
for i in range(n-k):
    ans = p - a[i] + a[i+k]
    
    if ans > p:
        print("Yes")
    else:
        print("No")
    p = ans

Solution (Python):
import numpy as np
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(N-K):
  sc = A[K+i] / A[i]
  if sc > 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())
score = list(map(int,input().split()))

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

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

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 = [] 
lst2 = []
sum=0
j=0
lst = [int(item) for item in input().split()]
i=0 
while i<n:
	if i==0:
		while i<k-1:
			sum=sum+lst[i]
			i=i+1
	else:
		sum=sum-lst[j]
		sum=sum+lst[i]
		j=j+1
	lst2.append(sum)
	i=i+1

x=len(lst2)
for i in range(1,x):
	if lst2[i]>lst2[i-1]:
		print("Yes")
	else:
		print("No")

Solution (Python):
import math
N,K=map(int,input().split())
A=list(map(int,input().split()))
count=0
before=0
now=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,=map(int,input().split())
A=[1]+A

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

count = 0

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

Solution (Python):
temp = input().split()
N = int(temp[0])
K = int(temp[1])
data = list(map(int, input().split()))

for i in range(N-K):
    if data[i]  <data[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] = [int(x) for x in input().split()]
    arr = [int(x) for x in input().split()]

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



main()

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





preX = 0
nowX = 1

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

Solution (Python):
def ip():
  	return list(map(int, input().split()))
[n,k]=ip()
arr=ip()
s=0
e=k
u=n-k
while u:
  if arr[s]<arr[e]:
      print("Yes")
  else:
      print("No")
  s+=1
  u-=1
  e+=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]>1:
    print ('Yes')
  else:
    print ('No')

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

n = a[0]
k = a[1]

c = []
bfr = 0
aft = 0
for i in range(k-1, n):
    if i != k-1:
        if b[i - k] < b[i]:
            c.append("Yes")
        else:
            c.append("No")
    
            
s_n = '\n'.join(c)
print(s_n)

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

k_idx = K - 1
ans_arr = []
for i in range(N - K):
    if a_arr[i] < a_arr[k_idx + 1]:
        ans_arr.append('Yes')
    else:
        ans_arr.append('No')
    k_idx += 1
for i in ans_arr:
    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("No")
    continue
  else:
    print("Yes")
    continue

Solution (Python):
l = list(map(int,input().split()))
n, k = l[0], l[1]
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):
line1 = input()
line2 = input()

n, k = tuple([int(val) for val in line1.split()])
a_list = [int(val) for val in line2.split()]

prev_sum = sum(a_list[0:k])
for i in range(k, n):
    current_sum = prev_sum - a_list[i-k] + a_list[i]
    if current_sum > prev_sum:
        print("Yes")
    else:
        print("No")
    prev_sum = current_sum

Solution (Python):
def solve():
    n,k=input().split()
    A=list(map(int,input().split()))
    n=int(n)
    k=int(k)
    for i in range(n-k):
        if A[i+k]>A[i]:
            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()))
memo = {}

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

Solution (Python):
N, K = [ int(v) for v in input().split(" ") ]
points = [ int(v) for v in input().split(" ") ]

for i in range(K+1, N+1):
  if points[i-K-1] < points[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):
"""
AtCoder :: M-Solutions Programming Contest 2020 :: Marks
https://atcoder.jp/contests/m-solutions2020/tasks/m_solutions2020_c
"""
import sys
from functools import reduce
from operator import add
from math import log


def solve(A, K):
    """Solve puzzle."""
    solns = []
    grade = reduce(add, A[:K])
    for i in range(K, len(A)):
        grade0 = (grade - A[i-K]) + A[i]
        if grade0 > grade:
            solns.append('Yes')
        else:
            solns.append('No')
        grade = grade0
    return(solns)


def main():
    """Main program."""
    N, K = (int(i) for i in sys.stdin.readline().split())
    A = [log(float(i)) for i in sys.stdin.readline().split()]
    print("\n".join(solve(A, K)))


if __name__ == '__main__':
    main()

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

for i in range(n-k):
    
    
    
    

    
    
    

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

Solution (Python):
import sys
from math import sqrt, gcd, ceil, log
from bisect import bisect, bisect_left
from collections import defaultdict, Counter, deque
from heapq import heapify, heappush, heappop
inp = sys.stdin.readline
read = lambda: list(map(int, inp().strip().split()))

def main():
	n, k = read(); arr = read()
	for i in range(k, n):
		print("YNeos"[arr[i] <= arr[i-k]::2])






if __name__ == "__main__":
	main()

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

c = N - K
l = []

for j in range(K, N):
        l.append(A[j - K])
        l.append(A[j])

L = len(l)
for i in range(0, L, 2):
    if l[i + 1] > 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(n-k):
    if a[i]>=a[i+k]:
        print("No")
    else:
        print("Yes")

Solution (Python):



def main():
    n, k = map(int, input().split())
    aList = list(map(int, input().split()))
    hyoukaList = []
    c = 1
    for i in range(n):
        if i < k:
            continue
        b = aList[i - k]
        a = aList[i]

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

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

for i in range(n-k):
    if li[i] < li[i + k]:
        print("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()))

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

Solution (Python):
from collections import deque

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

now = deque(a[0:k])
next = deque(a[k:])

for i in range(n-k):
    if now[0]<next[0]:
        print('Yes')
    else:
        print('No')
    now.append(next[0])
    now.popleft()
    next.popleft()

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()))
pre_score = 1
for i in range(k, n):
  after_score = pre_score*a[i]/a[i-k]
  if after_score > pre_score:
    print('Yes')
  else:
    print('No')

Solution (Python):


def main():
    import sys
    import math

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

    for i in range(len(A_list)):
        A_list[i] = math.log10( A_list[i] )


    point_K = 0
    
    for i in range(K):
        point_K += A_list[i]


    prev = point_K

    for i in range(K, len(A_list)):
        current = prev - A_list[i-K] + A_list[i]

        if current > prev:
            print("Yes")
        else:
            print("No")
        
        prev = current


if __name__ == "__main__":
    main()

Solution (Python):


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

    ans = ['No'] * (N - K)
    for i in range(N - K):
        tmp = A[K + i] / A[i]
        if 1 < tmp:
            ans[i] = 'Yes'
    print("\n".join(ans))


if __name__ == "__main__":
    main()

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

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

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







def getA(i):
    if i < 0:
        return 1
    elif i >= N:
        return 1
    else:
        return A[i]

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

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

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

B = []
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()))

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

answers = []

prev_score = scores[0]

for i in range(k, n):
    if prev_score < scores[i]:
        answers.append('Yes')
    else:
        answers.append('No')

    prev_score = scores[i - (k - 1)]

for answer in answers:
    print(answer)

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

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


def main():
  N, K = list(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')
    
    
    
    
    
    
    
    

  


if(__name__ == '__main__'):
  main()

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

Solution (Python):

a,b = map(int,input().split())
c = list(map(int,input().split()))
j = 0

for i in range(a-b):
    if int(c[i]) < int(c[b+j]):
        print("Yes")
        j += 1
    else:
        print("No")
        j += 1

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

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

st = 0
la = K

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

Solution (Python):
n, k = list(map(int, input().split()))
an = list(map(int, input().split()))
            
ank = an[:k]
for i in range(k, n):
    print(['No', 'Yes'][an[i] > ank[0]])
    ank.pop(0)
    ank.append(an[i])

Solution (Python):
n, k = map(int, input().split())
a = list(map(int, input().split()))
ans = ['No' for i in range(n - k)]


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


for i in ans:
    print(i)

Solution (Python):
import math
from decimal import *


def _run(n, k, a_list):
    integral_windows = [Decimal(0)] * (len(a_list) + 1)
    for i in range(len(a_list)):
        integral_windows[i + 1] = integral_windows[i] + Decimal(math.log10(a_list[i]))
    sliding_size = n - k
    for i in range(sliding_size):
        sum_value_a = integral_windows[k + i] - integral_windows[i]
        sum_value_b = integral_windows[k + i + 1] - integral_windows[i + 1]
        if sum_value_a < sum_value_b and (math.fabs(sum_value_b - sum_value_a) > 5e-25):
            print("Yes")
        else:
            print("No")


def _main():
    N, K = map(int, input().split())
    A_list = list(map(int, input().split()))
    _run(N, K, A_list)


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





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





if __name__ == '__main__':
    main()

Solution (Python):
n,k= list(map(int, input().strip().split()))
a = list(map(int, input().strip().split()))
b=[1]*n

    
for i in range(k+1,n+1):
    b[i-1]=a[i-1]/a[i-k-1]

    

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

Solution (Python):
from collections import deque
N,K = map(int,input().split())
C = deque(map(int,input().split()))
D = C.copy()

ans = 1
for i in range(K):
  C.popleft()
  

for i in range(N-K):
  preans = D.popleft()
  ans = C.popleft()
  
  
  
  if preans < ans:
    print("Yes")
  if preans >= ans:
    print("No")

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

for i in range(n - k):
    if a[i] <= a[i + k]:
        lists.append(0)
    else:
        lists.append(1)
lists.reverse()

for i in range(n - k):
    if lists[i] == 1:
        print("Yes")
    else:
        print("No")

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


ten=[0]*(N-K+1)
a=100000*(10**20)+0.1

 


ten[0]=Decimal(a)
for i in range(1,(N-K+1)):
    ten[i]=Decimal(ten[i-1]*A[K+i-1]/A[i-1])

for i in range(1,N-K+1):
    
    if ten[i]>ten[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 = list(map(int, input().split()))
a = list(map(int, input().split()))

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

for i in range(a[1],len(b)):
    if b[i]>b[i-a[1]]:
        print("Yes")
    else:
        print("No")

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

Solution (Python):

import sys

YES = "Yes"
NO = "No"

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

scores = [0] * K
scores[0] = A[0]
i = 1
while i < K:
    scores[i] = A[i]
    i += 1

while i < N:
    if A[i] > scores[i % K]:
        print(YES)
    else:
        print(NO)
    scores[i % K] = A[i]
    i += 1

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

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

for i in range(K-1,N-1):
  if A[i-(K-1)] < A[i+1]:

    print("Yes")
  else:
    print("No")

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