CodeEff/ECCO huggingface dataset:
# Original solution
import sys
from itertools import accumulate
import operator as op
input = sys.stdin.readline

n,k=list(map(int,input().split()))
L=list(map(int,input().split()))
N=[1]+list(accumulate(L,op.mul))

ans=[]
for i in range(k,n+1):
    val = N[i]/N[i-k]
    ans.append(val)

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


# Optimized solution
import sys
input = sys.stdin.readline

n,k=list(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')
# Original solution
import sys
input = lambda: sys.stdin.readline().rstrip()
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))

now = 1
for i in range(k):
    now *= a[i]
before = now

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


# Optimized solution
import sys
input = lambda: sys.stdin.readline().rstrip()
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))

now = 1
# for i in range(k):
#     now *= a[i]
# before = now

for i in range(n - k):
    # now *= a[i + k]
    # now /= a[i]
    if a[i] < a[i + k]:
        print('Yes')
    else:
        print('No')
    # before = now
# Original solution
import functools
import operator

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

old_score = 1
new_score = 1

for i in range(n - k + 1): #iはスタート地点
    old_score = new_score
    new_score = 1
    
    list_ = A[i: i + k] #Aのj番目の要素をかける
    new_score = functools.reduce(operator.mul, list_)

    if i != 0 and old_score < new_score:
        print("Yes")
    elif i != 0 and old_score >= new_score:    
        print("No")

# Optimized solution
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))

for i in range(n - k): #iはスタート地点
    old = A[i] #Aのj番目の要素をかける
    new = A[i + k]
    
    if old < new:
        print("Yes")
    else:
        print("No")
# Original solution
from collections import defaultdict
from collections import deque
from collections import Counter
import itertools
import math

def readInt():
	return int(eval(input()))
def readInts():
	return list(map(int, input().split()))
def readChar():
	return eval(input())
def readChars():
	return input().split()

n,k = readInts()
a = readInts()

base = 1
for i in range(k):
	base*=a[i]
t = base
#print(t)
base = base//a[0]

for i in range(k,n):
	base*=a[i]
	#print(base)
	if t>=base:
		print("No")
	else:
		print("Yes")
	t = base
	base=base//a[i-k+1]


# Optimized solution
from collections import defaultdict
from collections import deque
from collections import Counter
import itertools
import math

def readInt():
	return int(eval(input()))
def readInts():
	return list(map(int, input().split()))
def readChar():
	return eval(input())
def readChars():
	return input().split()

n,k = readInts()
a = readInts()


t = a[0]

for i in range(k,n):
	be = a[i-k]
	af = a[i]
	#print(base)
	if be>=af:
		print("No")
	else:
		print("Yes")
# Original solution
N, K = [int(a) for a in input().split()]
A = [int(a) for a in input().split()]
marks = []

prev = 1
for k in range(K):
    prev = (prev * A[K-1-k])
# print(prev)

for i in range(K, N):
    # print('div', i, K, i-K)
    prod = A[i]*(prev//A[i-K])
    if prev != -1:
        if prev < prod:
            print('Yes')
        else:
            print('No')
    prev = prod

# Optimized solution
N, K = [int(a) for a in input().split()]
A = [int(a) for a in input().split()]
marks = []

for i in range(K, N):
    prev = A[i-K]
    next_ = A[i]
    if prev < next_:
        print('Yes')
    else:
        print('No')
# Original solution
from collections import deque


def main():
    n, k = [int(x) for x in input().split()]
    scores = [int(x) for x in input().split()]
    scores_q = deque(scores)
    news = deque(scores[k:])
    former = 0
    rank = 1
    for score in scores[:k]:
        rank *= score

    for shift in range(n - k):
        former = rank
        remover = scores_q.popleft()
        new_commer = news.popleft()
        rank //= remover
        rank *= new_commer
        if former < rank:
            print('Yes')
        else:
            print('No')


if __name__ == '__main__':
    main()


# Optimized solution
def main():
    n, k = [int(x) for x in input().split()]
    scores = [int(x) for x in input().split()]

    for remover, new_commer in zip(scores, scores[k:]):
        if remover < new_commer:
            print('Yes')
        else:
            print('No')


if __name__ == '__main__':
    main()
# Original solution
def main():
    n, k = [int(x) for x in input().split()]
    scores = [int(x) for x in input().split()]

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


if __name__ == '__main__':
    main()


# Optimized solution
def main():
    n, k = [int(x) for x in input().split()]
    scores = [int(x) for x in input().split()]

    for index, new in enumerate(scores[k:]):
        if scores[index] < new:
            print('Yes')
        else:
            print('No')


if __name__ == '__main__':
    main()
# Original solution
def main():
    n, k = [int(x) for x in input().split()]
    scores = [int(x) for x in input().split()]
    # zip にすると2つのリストを作るのか，これよりも少し時間とメモリ増。
    {
        print('Yes' if scores[index] < new else 'No')
        for index, new in enumerate(scores[k:])}


if __name__ == '__main__':
    main()


# Optimized solution
def main():
    n, k = [int(x) for x in input().split()]
    scores = [int(x) for x in input().split()]
    for index, new in enumerate(scores[k:]):
        # zip にすると2つのリストを作るのか，これよりも少し時間とメモリ増。
        print(('Yes' if scores[index] < new else 'No'))


if __name__ == '__main__':
    main()
# Original solution
def main():
    n, k = [int(x) for x in input().split()]
    scores = [int(x) for x in input().split()]
    for index, new in enumerate(scores[k:]):
        # zip にすると2つのリストを作るのか，これよりも少し時間とメモリ増。
        print(('Yes' if scores[index] < new else 'No'))


if __name__ == '__main__':
    main()


# Optimized solution
def main():
    n, k = [int(x) for x in input().split()]
    scores = [int(x) for x in input().split()]
    # zip にすると2つのリストを作るのか，これよりも少し時間とメモリ増。
    print(('\n'.join('Yes' if scores[index] < new else 'No'
                    for index, new in enumerate(scores[k:]))))


if __name__ == '__main__':
    main()
# Original solution
#MSOL C 修正

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

def checker(i):
  l1 = A[i-K+1:i:]
  i1 = A[i-K]
  i2 = A[i]
  if i1 < i2:
    return "Yes"
  else:
    return "No"

for i in range(K,N):
  print((checker(i)))

# Optimized solution
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")
# Original solution
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
cnt = 1
for i in range(n):
    cnt*=a[i]
    if i>=k:
        m = cnt//a[i]
        cnt//=a[i-k]
        if cnt>m: print('Yes')
        else: print('No')

# Optimized solution
n, k = list(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')
# Original solution
import sys
N, K = list(map(int, input().split()))

def input():
    return sys.stdin.readline()[:-1]
A = list(map(int, input().split()))

hyouten = [0] * (N)

# 評点計算
for i in range(K-1, N):
    if i == K - 1:
        tmp = A[i]
        for j in range(1,K):
            tmp *= A[i-j]
    else:
        tmp //= A[i-K]
        tmp *= A[i]
    hyouten[i] = tmp

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


# Optimized solution
import sys
N, K = list(map(int, input().split()))

def input():
    return sys.stdin.readline()[:-1]
A = list(map(int, input().split()))


for i in range(K, N):
    if A[i-K] < A[i]:
        print('Yes')
    else:
        print("No")
# Original solution
n, k = list(map(int, input().split()))
items = list(input().split())

def main():
  for i in range(k+1, n+1):
    sum_prev, sum_next = (1, 1)

    for j in range(i-k-1, i-1):
      sum_prev *= int(items[j])
      sum_next *= int(items[j+1])

    if (sum_prev < sum_next):
      print("Yes")
    else:
      print("No")

main()


# Optimized solution
n, k = list(map(int, input().split()))
items = list(input().split())

for i in range(k, n):
  if (int(items[i]) > int(items[i-k])):
    print("Yes")
  else:
    print("No")
# Original solution
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))

count = 0

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

# Optimized solution
N,K = list(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')
# Original solution
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))

point = 1
for i in range(n):
    if k > i:
        point *= a[i]
        continue
    now = point
    now //= a[i - k]
    now *= a[i]
    if now > point:
        print('Yes')
    else:
        print('No')
    point = now


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

point = 0
for i in range(n):
    if k > i:
        point += a[i]
        continue
    now = point
    now -= a[i - k]
    now += a[i]
    if now > point:
        print('Yes')
    else:
        print('No')
    point = now
# Original solution
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
t=1
for i in a[:k]:
  t *= i
temp = [t]

for index, i in enumerate(a[k:]):
  temp.append(temp[-1] * i // a[index])
  
for i,j in zip(temp, temp[1:]):
  if i < j:
    print("Yes")
  else:
    print("No")

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

for i in range(k, n):
  if a[i] > a[i-k]:
    print("Yes")
  else:
    print("No")
# Original solution
n, k = list(map(int, input().split()))
A = [*list(map(int, input().split()))]

pre = 1
for i in range(k):
    pre *= A[i]

for i in range(k,n):
    now = pre//A[i-k] *A[i]
    if pre < now:
        print('Yes')
    else:
        print('No')
    pre = now


# Optimized solution
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')
# Original solution
# -*- coding: utf-8 -*-

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


# Optimized solution
# -*- coding: utf-8 -*-
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()
# Original solution
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))

from operator import mul
from functools import reduce

scores = []
judge_str = {True: "Yes", False: "No"}

for i in range(K, N+1):
    scores.append(reduce(mul, A[i-K:i]))
    if len(scores) == 1:
        continue
    else:
        print((judge_str[scores[i-K-1] < scores[i-K]]))


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

judge_str = {True: "Yes", False: "No"}

for i in range(K+1, N+1):
    print((judge_str[A[i-K-1] < A[i-1]]))
# Original solution
# -*- coding: utf-8 -*-
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))

score = [1] * (N-K+1)
for i in range(K, N+1):
  if i == K:
    for j in range(K):
      score[0] *= A[j]
    continue
    
  score[i-K] = (score[i-K-1] // A[i-K-1]) * A[i-1]
  if score[i-K] > score[i-K-1]:
    print('Yes')
  else:
    print('No')

# Optimized solution
# -*- coding: utf-8 -*-
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))

for i in range(K, N):
  if A[i] > A[i-K]:
    print('Yes')
  else:
    print('No')
# Original solution
n, k = list(map(int, input().split()))
data = list(map(int, input().split()))

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


# Optimized solution
n, k = list(map(int, input().split()))
data = list(map(int, input().split()))

for i in range(n-k):
    # if data[i:i+k][0] < data[i+1:i+k+1][-1]:
    # print("-----------------")
    # print( data[i:i+k] )
    # print( data[i+1:i+k+1] )

    # print( data[i] )
    # print( data[k+i] )
    # print("-----------------")

    if data[i] < data[k+i]:
        print("Yes")
        # print( data[i:i+k] )
        # print( data[i+1:i+k+1] )
    else:
        print("No")
# Original solution
n,k = list(map(int,input().split()))
A = list(map(int,input().split()))

pre = 1
for i in range(k):
    pre*=A[i]

for j in range(n-k):
    tmp = pre//A[j]*A[j+k]
    if pre<tmp:
        print('Yes')
    else:
        print('No')
    pre=tmp




# Optimized solution
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')
# Original solution
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
memo = []
for i in range(k,n+1):
    x = a[i-1] % mod
    for j in range(i-1, i-k, -1):
        y = a[j-1] % mod
        x *= y
    memo.append(x)

for test in range(1, len(memo)):
    if memo[test - 1] < memo[test]:
        print("Yes")
    else:
        print("No")

# Optimized solution
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")
# Original solution
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
s=sum(a[:k])
for i in range(n-k):
	t=sum(a[i+1:k+i+1])
	print(('YNeos'[s>=t::2]))
	s=t

# Optimized solution
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
s=sum(a[:k])
for i in range(n-k):
	t=s-a[i]+a[k+i]
	print(('YNeos'[s>=t::2]))
	s=t
# Original solution
from functools import reduce
from operator import mul

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

p_score = reduce(mul, a[:k])
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")


# Optimized solution
n, k = list(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")
# Original solution
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = [1] * (n-k+1)
for i in range(k):
  b[0] *= a[i]
for i in range(n-k):
  b[i+1] = b[i] * a[k+i] // a[i]
  if b[i+1] > b[i]:
    print("Yes")
  else:
    print("No")

# Optimized solution
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = [1] * (n-k+1)
for i in range(n-k):
  if a[k+i] > a[i]:
    print("Yes")
  else:
    print("No")
# Original solution
n, k = list(map(int, input().split()))
al = list(map(int, input().split()))
t = 1
for i in range(n):
    tt = t
    t *= al[i]

    if i < k:
        continue
    else:
        t //= al[i-k]
        if tt < t:
            print('Yes')
        else:
            print('No')


# Optimized solution
n, k = list(map(int, input().split()))
al = list(map(int, input().split()))
t = 1
for i in range(n):
    if i < k:
        continue
    else:
        t //= al[i-k]
        if al[i-k] < al[i]:
            print('Yes')
        else:
            print('No')
# Original solution

def main():
    [n, k] = [int(x) for x in input().split()]
    arr = [int(x) for x in input().split()]

    temp = 1
    for i in range(k):
        temp *= arr[i]

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

        temp = t


main()



# Optimized solution
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()
# Original solution
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))

ans = []
flag = 1
for i in range(N):
    if a[i] < a[i + K]:
        print('Yes')
    else:
        print("No")
    flag += 1
    if flag == N-K+1:
        break

# Optimized solution
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))

flag = 1
for i in range(N):
    if a[i] < a[i + K]:
        print('Yes')
    else:
        print("No")
    flag += 1
    if flag == N-K+1:
        break
# Original solution
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))

flag = 1
for i in range(N):
    if a[i] < a[i + K]:
        print('Yes')
    else:
        print("No")
    flag += 1
    if flag == N-K+1:
        break

# Optimized solution
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")
# Original solution
N, K = [int(x) for x in input().strip().split(" ")]
A = [int(x) for x in input().strip().split(" ")]

def mul(A):
    b = 1
    for a in A:
        b *= a
    return b

scores = [mul(A[i-K+1:i+1]) for i in range(K-1, N)]

for i, S in enumerate(scores):
    if i == 0:
        continue
    if S > scores[i - 1]:
        print("Yes")
    else:
        print("No")


# Optimized solution
N, K = [int(x) for x in input().strip().split(" ")]
A = [int(x) for x in input().strip().split(" ")]

for i in range(K, N):
    if A[i] > A[i-K]:
        print("Yes")
    else:
        print("No")
# Original solution
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))

sum=[0]*n
sum[0]=a[0]
for i in range(1,n):
    sum[i]=sum[i-1]*a[i]
p=[0]*n
for i in range(k-1,n):
    if i==k-1:
        p[i]=sum[i]
    else:
        p[i]=sum[i]/sum[i-k]


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


# Optimized solution
import sys
def input():
    return sys.stdin.readline()[:-1]

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

    sum=[0]*n
    sum[0]=a[0]
    for i in range(1,n):
        sum[i]=sum[i-1]*a[i]
        p=[0]*n
    for i in range(k-1,n):
        if i==k-1:
            p[i]=sum[i]
        else:
            p[i]=sum[i]/sum[i-k]


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


if __name__ == '__main__':
    main()
# Original solution
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
prod=1
for i in range(0,k):
    prod=prod*a[i]
i=0
for j in range(k,len(a)):
    if a[j]>a[i]:
        print("Yes")
    else:
        print("No")
    i+=1


# Optimized solution
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
i=0
for j in range(k,len(a)):
    if a[j]>a[i]:
        print("Yes")
    else:
        print("No")
    i+=1
# Original solution
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))

i = n - k
score_prev = 1
for i in range(k):
    score_prev *= A[i]
#print(score_prev)
for i in range(k, n):
    score_now = score_prev*A[i]//A[i-k]
#    print(score_now)
    if score_now > score_prev:
        print('Yes')
    else:
        print('No')
    score_prev = score_now

# Optimized solution
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))

for i in range(k, n):
    if A[i] > A[i-k]:
        print('Yes')
    else:
        print('No')
# Original solution
import sys
input = sys.stdin.readline

n, k = list(map(int, input().split()))
AA =[]
c =False
for a in input().strip().split():
    a = int(a)
    if not c:
        AA.append(a)
        if len(AA) == k:
            c = True
    else:
        base = AA[0]
        next = a
        if next - base > 0:
            print("Yes")
        else:
            print("No")
        AA = AA[1:]
        AA.append(a)


# Optimized solution
n, k = list(map(int, input().split()))
AA =[int(a) for a in input().split()]


for b, t in zip(AA, AA[k:]):
    if t > b:
        print("Yes")
    else:
        print("No")
# Original solution
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))

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

# Optimized solution
n,k = list(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")
# Original solution
# 解説

def main():
    from math import log10

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

    def accumulate(a):
        s = 0
        for x in a:
            s += log10(x)
            yield s

    *acc, = accumulate(A)
    for i in range(N - 1, K - 1, -1):
        acc[i] -= acc[i - K]

    for i in range(K, N):
        if acc[i] > acc[i - 1] + 1e-10:
            print('Yes')
        else:
            print('No')


if __name__ == '__main__':
    main()


# Optimized solution
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()