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

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

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

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

Solution (Python):
N,K = map(int,input().split())
A = list(map(int,input().split()))
left = 0
right = K
while True:
  if right>=N:
    break
  else:
    if A[right]>A[left]:
      print('Yes')
    else:
      print('No')

    left += 1
    right += 1

Solution (Python):
n, k = (int(x) for x in input().split())
A = list(int(x) for x in 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()))

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

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

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

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

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

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

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

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

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

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

Solution (Python):


import re
import math
from collections import defaultdict,deque,Counter
from fractions import Fraction
import bisect
import itertools
from itertools import accumulate
from copy import deepcopy
import heapq
import random
import time
import os
import sys
from functools import lru_cache,reduce
readline=sys.stdin.readline
sys.setrecursionlimit(100000)
alp="abcdefghijklmnopqrstuvwxyz"
numbers="0123456789"
mod=int(10**9+7)
inf=int(10**19)
class Set():
    def __init__(self,A=[]):
        self.heap=[]
        self.dic=defaultdict(bool)
        self.size=0
        for a in A:self.add(a)
    
    def __str__(self):
        return str(self.heap)
    
    def add(self,x):
        if not self.find(x):
            heapq.heappush(self.heap,x)
            self.dic[x]=True
            self.size+=1

    def remove(self,x):
        if self.find(x):
            self.dic[x]=False
            self.size-=1

    def find(self,x):
        return self.dic[x]
    
    def top(self):
        while self.heap and self.dic[self.heap[0]]==False:
            heapq.heappop(self.heap)
        if self.heap:return self.heap[0]
        else:return None

    def pop(self):
        ret=None
        if self.heap:
            ret=self.top()
            self.remove(ret)
        return ret
class multiset():
    def __init__(self,A=[]):
        self.heap=[]
        self.dic=defaultdict(int)
        self.size=0
        for a in A:self.add(a)
    
    def __str__(self):
        return str(self.heap)
    
    def add(self,x):
        heapq.heappush(self.heap,x)
        self.dic[x]+=1
        self.size+=1

    def remove(self,x):
        if self.dic[x]>0:
            self.dic[x]-=1
            self.size-=1
    
    def count(self,x):
        return self.dic[x]

    def find(self,x):
        return self.dic[x]>0
    
    def top(self):
        while self.heap and self.dic[self.heap[0]]==0:
            heapq.heappop(self.heap)
        if self.heap:return self.heap[0]
        else:return None

    def pop(self):
        ret=None
        if self.heap:
            ret=self.top()
            self.remove(ret)
        return ret
class Edge():
    def __init__(self,x,y,val=1):
        self.x=x
        self.y=y
        self.val=val
class unionfind():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(n)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):
            self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def yn(b):print("yes" if b else "no")
def Yn(b):print("Yes" if b else "No")
def YN(b):print("YES" if b else "NO")
def ispow(a,b):
    now=b
    while now<a:
        now*=b
    return now==a
def getbin(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def getfacs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod_>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def nextcomb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:return num
def getprimes(n):
    if n==0:return []
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    ret=[]
    for a in range(n+1):
        if(A[a]):ret.append(a)
    return ret
def isprime(num):
    if(num<=1):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(b,t,f):return t if b else f
def factorize(n):
    b = 2
    ret=defaultdict(int)
    while b * b <= n:
        while n % b == 0:
            n //= b
            ret[b]+=1
        b+=1
    if n > 1:ret[n]+=1
    return ret
def inputintlist(row=1): 
    if row==1:
        ret=list(map(int,input().split()))
    else:
        ret=[None]*row
        for a in range(row):
            ret[a]=int(input())
    return ret
def inputfloatlist(row=1): 
    if row==1:
        ret=list(map(float,input().split()))
    else:
        ret=[None]*row
        for a in range(row):
            ret[a]=float(input())
    return ret
def istanchouzouka(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>=a:
            f=False
        prev=a
    return f
def istanchouhigensyou(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>a:
            f=False
        prev=a
    return f
def getallsum(A):
    s=sum(A)
    dp=defaultdict(int)
    dp[0]=1
    for a in range(0,len(A)):
        for b in range(s,-1,-1):
            if b-A[a]>=0:
                dp[b]+=dp[b-A[a]]
    return dp
def yuukoutomukou(edges):
    ret=deepcopy(edges)
    for edge in edges:
        if not edge.x==edge.y:
            ret.append(Edge(edge.y,edge.x,edge.val))
    return ret
def dijkstra(edges,V,start):
    mincost=[inf]*V
    G=[[] for a in range(V)]
    for edge in edges:
        G[edge.x].append([edge.val,edge.y])
    Q=PriorityQueue()
    Q.put([0,start])
    while not Q.empty():
        nowcost,nowx=Q.get()
        if mincost[nowx]==inf:
            mincost[nowx]=nowcost
            for cost,y in G[nowx]:
                newcost=nowcost+cost
                Q.put([newcost,y])
    return mincost
def warshallfloyd(edges,V):
    mincost=[[inf for b in range(V)] for a in range(V)]
    for a in range(V):mincost[a][a]=0
    for edge in edges:
        mincost[edge.x][edge.y]=min(mincost[edge.x][edge.y],edge.val)
    for k in range(V):
        for s in range(V):
            for t in range(V):
                if mincost[s][k]==inf or mincost[k][t]==inf:continue
                mincost[s][t]=min(mincost[s][t],mincost[s][k]+mincost[k][t])
    return mincost
def bellemanford(edges,V,start):
    mincost=[inf]*V
    mincost[start]=0
    for _ in range(V):
        for edge in edges:
            if mincost[edge.x]==inf:continue
            mincost[edge.y]=min(mincost[edge.y],mincost[edge.x]+edge.val)
    return mincost
def getmd(x1,y1,x2,y2):return abs(x1-x2)+abs(y1-y2)
def geted(x1,y1,x2,y2):return math.sqrt((x1-x2)**2+(y1-y2)**2)
class fordfulkerson():
    def __init__(self,edges,V,s,t):
        self.V=V
        self.used=[False]*V
        self.G=[[] for a in range(V)]
        self.s=s
        self.t=t
        for edge in edges:
            self.G[edge.x].append({"x":edge.x,"y":edge.y,"cap":edge.val,"rev":len(self.G[edge.y])})
            self.G[edge.y].append({"x":edge.y,"y":edge.x,"cap":0,"rev":len(self.G[edge.x])-1})
    def dfs(self,v,t,f=inf):
        if v==t:return f
        self.used[v]=True
        for a in range(len(self.G[v])):
            x=self.G[v][a]["x"]
            y=self.G[v][a]["y"]
            cap=self.G[v][a]["cap"]
            rev=self.G[y][self.G[x][a]["rev"]]
            if self.used[y] or cap==0:continue
            f2=self.dfs(y,t,min(f,cap))
            if f2>0:
                self.G[v][a]["cap"]-=f2
                rev["cap"]+=f2
                return f2
        return 0
    def maxflow(self):
        flow=0
        while True:
            self.used=[False]*V
            zouka=self.dfs(self.s,self.t)
            if zouka==0:break
            flow+=zouka
        return flow
def zipsort(*args):
    ziplist=sorted(zip(*args))
    for a in range(len(args)):
        for b in range(len(ziplist)):
            args[a][b]=ziplist[b][a]
def zipreverse(*args):
    ziplist=list(zip(*args))
    rev=[]
    for a in range(len(ziplist)-1,-1,-1):
        rev.append(ziplist[a])
    for a in range(len(args)):
        for b in range(len(rev)):
            args[a][b]=rev[b][a]

def to10(A):
    ret=0
    for a in range(len(A)-1,-1,-1):
        ret+=X[a]*2**(N-1-a)
    return ret


N,K=inputintlist()
A=inputintlist()
for a in range(N-K):
    Yn(A[a]<A[K+a])

Solution (Python):



import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
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 = list(map(int, input().split()))

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

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

N,K = (int(x) for x in input().rstrip('\n').split())
As = [int(x) for x in input().rstrip('\n').split()]
for i in range(N-K):
  if As[i] < As[i+K]:
    print('Yes')
  else:
    print('No')

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

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

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

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

Solution (Python):
import sys, io, os, re
from bisect import bisect, bisect_left, bisect_right, insort, insort_left, insort_right
from pprint import pprint
from math import sin, cos, pi, radians, sqrt, floor, ceil
from copy import copy, deepcopy
from collections import deque
from fractions import gcd
from functools import reduce
from itertools import groupby
from heapq import heapify, heappush, heappop



n1 = lambda: int(sys.stdin.readline().strip())
nn = lambda: list(map(int, sys.stdin.readline().strip().split()))
f1 = lambda: float(sys.stdin.readline().strip())
fn = lambda: list(map(float, sys.stdin.readline().strip().split()))
s1 = lambda: sys.stdin.readline().strip()
sn = lambda: list(sys.stdin.readline().strip().split())
nl = lambda n: [n1() for _ in range(n)]
fl = lambda n: [f1() for _ in range(n)]
sl = lambda n: [s1() for _ in range(n)]
nm = lambda n: [nn() for _ in range(n)]
fm = lambda n: [fn() for _ in range(n)]
sm = lambda n: [sn() for _ in range(n)]

def array1(n, d=0): return [d] * n
def array2(n, m, d=0): return [[d] * m for x in range(n)]
def array3(n, m, l, d=0): return [[[d] * l for y in xrange(m)] for x in xrange(n)]
def linc(A, d=1): return map(lambda x: x + d, A)
def ldec(A, d=1): return map(lambda x: x - d, A)

N, K = nn()
A = nn()

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

def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))

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

if __name__ == '__main__':
    main()

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

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

Solution (Python):
from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))

n,k=nii()
a=lnii()

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

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

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

n, k = map(int, input().split(" "))

As = map(int, input().split(" "))

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

Solution (Python):

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n,k=INTM()
    A=LIST()
    for i in range(n-k):
        
        if A[i]<A[i+k]:
            print('Yes')
        else:
            print('No')
        
    
    
if __name__ == '__main__':
    do()

Solution (Python):
n, k = map(int, input().split())
arr = [int(j) for j in input().split()]
ans = []
for i in range(k, n):
	if arr[i] > arr[i-k]:
		ans += ["Yes"]
	else:
		ans += ["No"]
print(*ans, sep='\n')

Solution (Python):
import sys
sys.setrecursionlimit(1000000000)
import math
from math import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, chain, product
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    num = 1
    for i in range(n, n-k, -1):
        num = num * i % modp
    den = 1
    for i in range(2, k+1):
        den = den * i % modp
    return num * get_inv(den, modp) % modp

def comb_from_list(n, k, modp, fs, invs):
    return fs[n] * invs[n-k] * invs[k] % modp



class UnionFindEx:
    def __init__(self, size):
        
        self.roots = [-1] * size
    def getRootID(self, i):
        r = self.roots[i]
        if r < 0:   
            return i
        else:
            r = self.getRootID(r)
            self.roots[i] = r
            return r
    def getGroupSize(self, i):
        return -self.roots[self.getRootID(i)]
    def connect(self, i, j):
        r1, r2 = self.getRootID(i), self.getRootID(j)
        if r1 == r2:
            return False
        if self.getGroupSize(r1) < self.getGroupSize(r2):
            r1, r2 = r2, r1
        self.roots[r1] += self.roots[r2]    
        self.roots[r2] = r1
        return True

Yes = 'Yes'
No = 'No'


def main():
    N, K = mis()
    A = lmis()
    for i in range(K, N):
        print(Yes if A[i-K]<A[i] else No)





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

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

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

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

for i in range(N-K):
    print(['No','Yes'][A[a]<A[b]])
    a+=1
    b+=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):


import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())

def resolve():
    N, K = iim()
    *A, = iim()

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

    print(*ans, sep="\n")

if __name__ == "__main__":
    resolve()

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

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

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

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

def main():
    N,K = map(int, readline().split())
    A = [int(i) for i in readline().split()]

    ans = []
    for i in range(N-K):
        if A[i+K] > A[i]:
            ans.append("Yes")
        else:
            ans.append("No")
    
    print("\n".join(ans))


if __name__ == "__main__":
    main()

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

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

Solution (Python):
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
count = 0
ans = "No"

N,K = I()
A = l()


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

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

now=1

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

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

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

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

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

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

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

Solution (Python):
FAST_IO = 1
if FAST_IO:
    import io, sys, atexit
    rr = iter(sys.stdin.read().splitlines()).next
    sys.stdout = _OUTPUT_BUFFER = io.BytesIO()

    @atexit.register
    def write():
        sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())
else:
    rr = raw_input
rri = lambda: int(rr())
rrm = lambda: map(int, rr().split())
rrmm = lambda n: [rrm() for _ in xrange(n)]
N, K = rrm()
arr = rrm()
def solve(N,K, arr):
    ans = []
    for i in range(K, N):
        if arr[i]>arr[i-K]:
            ans.append(True)
        else:
            ans.append(False)
    return ans
ans = solve(N, K, arr)
for res in ans:
    if res:
        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 - 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:
        print('Yes' if a[i-k]<a[i] else '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(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[K+i]:
        print("Yes")
    else:
        print("No")

Solution (Python):




import sys
import heapq, functools, collections
import random
from collections import Counter, defaultdict











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



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

Solution (Python):
n,k,*aa = map(int, open(0).read().split())

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


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

Solution (Python):
from collections import deque

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

d = deque(a_list[:K])
for i in range(K, N):
    in_a = a_list[i]
    out_a = d.popleft()
    d.append(in_a)
    if in_a > out_a:
        print("Yes")
    else:
        print("No")

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

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
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 [int(x) for x in sys.stdin.readline().split()]

def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

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

  ind=0
  nxt=k
  ans=[]
  for _ in range(n-k):
    if l[ind]<l[nxt]:
      ans.append('Yes')
    else:
      ans.append('No')

    ind+=1
    nxt+=1

  for x in ans:
    print(x)

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

tmp=0

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




for item in ans:
    print(item)

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

temp = 1



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

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


if __name__ == '__main__':
    main()

Solution (Python):
import sys
from math import ceil
def input(): return sys.stdin.readline().strip()


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

if __name__ == "__main__":
    main()

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

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

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

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

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

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

Solution (Python):


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

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

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


main()

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

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