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 = sys.stdin.readline

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

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

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

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

for r in range(k, n, 1):
    l = r - k
    print('Yes' if a[l] < a[r] 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):
N, K = [int(_) for _ in input().split()]
A = [int(_) for _ in input().split()]

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

Solution (Python):
N, K, *A = [int(_) for _ in open(0).read().split()]
for a, b in zip(A, A[K:]):
    print('Yes' if a < b else 'No')

Solution (Python):
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

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

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

if __name__ == '__main__':
    main()

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

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


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

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

cnt=0

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

	cnt+=1

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

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

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

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

for i in range(K, N):
    if A[i - 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())

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

for idx, v in enumerate(li_a):
    if idx <= (k - 1):
        pass
    else:
        if v > li_a[idx - 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 'No')

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

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

Solution (Python):
def main():
    n,k=map(int,input().split())
    li=map(int,input().split())
    x=list(li)
    a=x[0:k]
    for i in range(k,n):
        if(a[0]<x[i]):
            print('Yes')
        else:
            print('No')
        del a[0]
        a.append(x[i])
    
main()

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

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

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


def main():
    n, k = map(int, input().split())
    A = list(map(int, input().split()))
    for a1, a2 in zip(A[:-k], A[k:]):
        if a1 < a2:
            print("Yes")
        else:
            print("No")


if __name__ == "__main__":
    main()

Solution (Python):



def marks(n, k, a):
    results = []
    for i in range(n - k):
        if a[i] < a[i + k]:
            results.append("Yes")
        else:
            results.append("No")
    return results


if __name__ == "__main__":
    n, k = map(int, input().split())
    a = list(map(int, input().split()))
    results = marks(n, k, a)
    for i in results:
        print(i)

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):
	print('Yes' if A[i] > A[i-K] else '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 = list(map(int,input().split()))

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

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

Solution (Python):
import sys
import itertools

import time
import math
import heapq
from collections import defaultdict
sys.setrecursionlimit(10 ** 7)
 
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines



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

index = 0
left = A[index]

for i in range(K+1, N):

    if A[index] < A[i]:
        print("Yes")
    else:
        print("No")

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

left = 0
right = k
while right < n:
    if data[left] < data[right]:
        print('Yes')
    else:
        print('No')
    left += 1
    right += 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[i+K]:
        print("Yes")
    else:
        print("No")

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

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

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

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

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

Solution (Python):
from sys import stdin, stdout, setrecursionlimit
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
import math

rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()	
rli = lambda: map(int, stdin.readline().split())
rlf = lambda: map(float, stdin.readline().split())

INF, NINF = float('inf'), float('-inf')

def main():
	n, k = rli()
	A = list(math.log(x) for x in rli())
	prev, score = 1, 1
	for i, a in enumerate(A):
		prev = score
		score += a 
		if i >= k:
			score -= A[i-k]
			if score > prev:
				print("Yes")
			else:
				print("No")
	stdout.close()

if __name__ == "__main__":
	main()

Solution (Python):
def main():
    N, K = input_ints()
    A = input_int_list_in_line()

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


def input_ints():
    line_list = input().split()

    if len(line_list) == 1:
        return int(line_list[0])
    else:
        return map(int, line_list)


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


def input_int_tuple_list(n: int):
    return [tuple(map(int, input().split())) for _ in range(n)]


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

l = 0
r = l + K
while r < N:
    ans = 'Yes' if A[l] < A[r] else 'No'
    print(ans)
    l += 1
    r += 1

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

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

Solution (Python):
def find(A,K):
    ANS = []
    for i in range(K,len(A)):
        
        
        
        
        if A[i] > A[i-K]:
            ANS += ["Yes"]
        else:
            ANS += ["No"]
    print("\n".join(ANS))

n,k = list(map(int,input().strip().split()))
A = list(map(int,input().strip().split()))
find(A,k)

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

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

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

answers = []
for i in range(k, n):
    answers.append(a[i-k] < a[i])
for ans in answers:
    if ans:
        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()
n = int(n)
k = int(k)
a = [int(s) for s in input().split()]
sums = []
K = k - 1
for i in range(K,n - 1):
    if(a[i - K] < a[i + 1]):
        print("Yes")
    else:
        print("No")

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

Solution (Python):
N, K, *A = map(int, open(0).read().split())

for a, b in zip(A[K:], A):
    if a > b:
        print("Yes")
    else:
        print("No")

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

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

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

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

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

Solution (Python):


from pprint import pprint
from collections import deque, defaultdict
import itertools
import math
import sys

sys.setrecursionlimit(10 ** 6)
INF = float('inf')


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

s = [0] * (N+1)
for i in range(N):
    s[i+1] = s[i] + A[i]


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

Solution (Python):


from pprint import pprint
from collections import deque, defaultdict
import itertools
import math
import sys

sys.setrecursionlimit(10 ** 6)
INF = float('inf')


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

s = [0] * (N+1)
for i in range(N):
    s[i+1] = s[i] + A[i]


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

Solution (Python):
n, k = map(int, input().split())
a_lst = list(map(int, input().split()))
for i in range(k, n):
    
    if a_lst[i - n-k] < a_lst[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 main():
    import sys
    input = sys.stdin.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')


if __name__ == '__main__':
    main()

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


last = 0
for i in range(k):
    last += arr[i]

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

Solution (Python):
import math
n, k = [int(x) for x in input().strip().split()]
arr = [int(x) for x in input().strip().split()]
arr = [math.log10(x) for x in arr]


last = 0
for i in range(k):
    last += arr[i]

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

Solution (Python):
tmp = (input().split(' '))
n = int(tmp[0])
k = int(tmp[1])
tmp = input().split(' ')
map_tmp = map(int,tmp)
grades = list(map_tmp)
j = k
while j < n:
  curr_res = grades[j]
  prev_res = grades[j-k]
  if curr_res > prev_res:
    print('Yes')
  else:
    print('No')
  
  j+=1

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

n,k = inpm()
a = inpl()

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

Solution (Python):
'''
自宅用PCでの解答
'''
import math

import itertools
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit


ipt = stdin.readline
setrecursionlimit(10**7)
mod = 10**9+7

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

    return None

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+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):
from functools import reduce
from operator import mul

N,K,*A = map(int,open(0).read().split())
base = sum(A[:K])
for i in range(K,N):
    score = base - A[i-K] + A[i]
    print("Yes" if base < score else "No")
    base = score

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

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

Solution (Python):
import sys
read = sys.stdin.readline
import time
import math
import itertools as it
def inpl():
    return list(map(int, input().split()))
st = time.perf_counter()


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


ed = time.perf_counter()
print('time:', ed-st, file=sys.stderr)

Solution (Python):
import sys
read = sys.stdin.readline
import time
import math
import itertools as it
def inpl():
    return list(map(int, input().split()))
st = time.perf_counter()


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


ed = time.perf_counter()
print('time:', ed-st, file=sys.stderr)

Solution (Python):
n, k = map(int, input().split(' '))
a = [int(tmp) for tmp in input().split(' ')]
[print('Yes') if a < b else print('No') for a, b in zip(a[:n - k], a[k:])]

Solution (Python):

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

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

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

Solution (Python):
def main():
    n, k = map(int, input().split())
    A = list(map(int, input().split()))
    [print('Yes') if a < b else print('No') for a, b in zip(A[:n - k], A[k:])]

if __name__ == '__main__':
    main()

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

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

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

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()))
ans = ['Yes' if A[i] > A[i - K] else 'No' for i in range(K, N)]
print("\n".join(ans))

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

Solution (Python):

N, K = map(int, input().split())
A = list(map(int, input().split()))  
j = 0
i = K
ct = 1
while ct <= (N - K):
    if A[j] < A[i]:
        print("Yes")
    else:
        print("No")
    j += 1
    i += 1
    ct += 1

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

N, K = map(int, input().split())
A = [0] + list(map(int, sys.stdin.readline().rsplit()))

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

Solution (Python):
import sys
from collections import deque,defaultdict

I=sys.stdin.readline

def ii():
	return int(I().strip())
def li():
	return list(map(int,I().strip().split()))

def mi():
	return map(int,I().strip().split())


def main():
	ans=""
	n,k=mi()
	arr=li()
	a=0
	for i in range(n-k):
		tmp=arr[k+i]
		if tmp>arr[a]:
			ans+="Yes\n"
		else:
			ans+="No\n"
		a+=1
	print(ans)








		


		










		






if __name__ == '__main__':
	main()

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

Solution (Python):
a=[input() for i in range(2)]
a1=[int(i) for i in a[0].split()]
a2=[int(i) for i in a[1].split()]
k=a1[1]
for i in range(a1[0]-a1[1]):
	if a2[i]<a2[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(n-k):
  if a[i+k] > a[i]:
    print("Yes")
  else:
    print("No")

Solution (Python):
n,k,*a=map(int,open(0).read().split())
for i in range(n-k):print('YNeos'[a[i+k]<=a[i]::2])

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

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

Solution (Python):
import numpy as np
n, k = map(int, input().split())
a = list(map(int, input().split()))
b = np.prod(a[:k])
for i in range(k, n):
  c = a[i - k]
  d = a[i]
  if c < d:
    print('Yes')
  else:
    print('No')
  b = b * d // c

Solution (Python):
def c_marks():
    N, K = [int(i) for i in input().split()]
    A = [int(i) for i in input().split()]
    ans = ['Yes' if A[i + K] > A[i] else 'No' for i in range(N - K)]
    return '\n'.join(ans)

print(c_marks())

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    n,k = LI()
    a = LI()

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

    return JA(r, "\n")

print(main())

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

Solution (Python):
N,K=[int(s) for s in input().split()]
ls=[int(s) for s in input().split()]
for i in range(K,N):
  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()))
 
answers = ["Yes" if A[i] > A[i-K] else "No" for i in range(K, N)]
print("\n".join(answers))

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

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

Solution (Python):
import sys
import decimal

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


def main():
    N, K = [int(x) for x in input().split()]
    A = [int(x) for x in input().split()]
    ans = []
    x = decimal.Decimal(1)
    for i in range(N - K):
        prev = x
        x *= decimal.Decimal(A[i + K])
        x /= decimal.Decimal(A[i])
        if x > prev:
            print("Yes")
        else:
            print("No")


if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

Solution (Python):
import math
import collections
import fractions
import itertools
import functools
import operator

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

if __name__ == "__main__":
    solve()

Solution (Python):
def solve():
    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 print("No")
    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
import math as mt
import sys, string
from collections import Counter, defaultdict
input = sys.stdin.readline

MOD = 1000000007


I = lambda : int(input())
M = lambda : map(int, input().split())
Ms = lambda : map(str, input().split()) 
ARR = lambda: list(map(int, input().split()))

def main():
    n, k = M()
    arr = ARR()
    for i in range(n - k):
        
        if arr[k + i] > arr[i]:
            print("Yes")
        else:
            print("No")
        



tc = 1
for _ in range(tc):
    main()

Solution (Python):
import math
import collections
import fractions
import itertools
import functools
import operator

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")
    return 0

if __name__ == "__main__":
    solve()

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

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

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

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

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