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()))
tmp = 0
c = 0
ls = [100]
for i in range(k):
    tmp += a[i]
ls[0] = tmp
for i in range(n-k):
    tmp -= a[i]
    tmp += a[i+k]
    if ls[0] >= tmp:
        print("No")
    else:
        print("Yes")
    ls[0] = tmp

Solution (Python):
n,k=map(int,input().split())
l=[int(x) for x in input().split()]
j=0
for i in range(k,n):
    p=l[j]
    q=l[i]
    if(q>p):
        print("Yes")
    else:
        print("No")
    j=j+1

Solution (Python):
import numpy as np

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

A_1 = np.array(A[K:])
A_2 = np.array(A[:-K])

A_bool = A_1 - A_2

for a_bool in A_bool:
    if a_bool > 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
N, K = map(lambda x:int(x), input().split(' '))
scores = list(map(lambda x:int(x), input().split(' ')))
for i in range(N-K):
    if scores[i] < scores[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())
al = list(map(int, input().split()))
for i in range(k, n):
    print('Yes' if al[i] > al[i - k] else 'No')

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

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

if __name__ == '__main__':
    main()

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

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

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

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

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


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

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

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

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

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

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

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

for i in range(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()))
mae = A[0]

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

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

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

grades = [0] * n

'''
5 3
96 98 95 100 20
'''

for i in range(k-1, n):
  if i == k-1: grades[i] = sum(marks[:i+1])
  else:
    grades[i] = grades[i-1] + marks[i] - marks[i-k]
    
for i in range(k,n):
  if grades[i] > grades[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=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):
""" C
    https://atcoder.jp/contests/m-solutions2020/tasks/m_solutions2020_c
"""
import sys
import math
from functools import reduce
from bisect import bisect_left

def readString():
    return sys.stdin.readline()

def readInteger():
    return int(readString())

def readStringSet(n):
    return sys.stdin.readline().split(" ")[:n]

def readIntegerSet(n):
    return list(map(int, readStringSet(n)))

def readIntegerMatrix(n, m):
    return reduce(lambda acc, _: acc + [readIntegerSet(m)], range(0, n), [])

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

if __name__ == "__main__":
    _N, _K = readIntegerSet(2)
    _A = readIntegerSet(_N)

    main(_N, _K, _A)

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

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

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

def solve(N, K, A):
    """
    N <= 200,000
    """
    for i in range(K,N):
        prev = A[i-K]
        P = A[i]
        if prev >= P:
            print("No")
        else:
            print("Yes")

solve(N, K, A)

Solution (Python):
import sys

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)


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(N-K):
    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()))

results = list()
for first, second in zip(A[0:N - K], A[K:N]):
    if second > first:
        results.append(True)
    else:
        results.append(False)

for res in results:
    if res:
        print('Yes')
    else:
        print('No')

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

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

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, K = map(int, readline().split())
A = list(map(int, readline().split()))

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

Solution (Python):

import sys
input = sys.stdin.readline


def ceil(x):
    if x != int(x):
        x = int(x) + 1;
    return x;
    

def swaparr(arr, a,b):
    temp = arr[a];
    arr[a] = arr[b];
    arr[b] = temp


def gcd(a,b):
    if b == 0:
        return a
    return gcd(b, a % b);


def nCr(n, k): 
    if(k > n - k): 
        k = n - k 
    res = 1
    for i in range(k): 
        res = res * (n - i) 
        res = res / (i + 1) 
    return int(res) 


def upper_bound(a, x, lo=0, hi = None):
    if hi == None:
        hi = len(a);
    while lo < hi:
        mid = (lo+hi)//2
        if a[mid] < x:
            lo = mid+1
        else:
            hi = mid
    return lo


def primefs(n):
    
    primes = {}
    while(n%2 == 0 and n > 0):
        primes[2] = primes.get(2, 0) + 1
        n = n//2
    for i in range(3, int(n**0.5)+2, 2):
        while(n%i == 0 and n > 0):
            primes[i] = primes.get(i, 0) + 1
            n = n//i
    if n > 2:
        primes[n] = primes.get(n, 0) + 1
    
    
    return primes


def power(x, y, p): 
    res = 1
    x = x % p  
    if (x == 0) : 
        return 0
    while (y > 0) : 
        if ((y & 1) == 1) : 
            res = (res * x) % p 
        y = y >> 1      
        x = (x * x) % p 
    return res 


def swap(a,b):
    temp = a
    a = b
    b = temp
    return a,b









def find(x, link):
    p = x;
    while( p != link[p]):
        p = link[p];
    
    while( x != p):
        nex = link[x];
        link[x] = p;
        x = nex;
    return p;




def union(x, y, link, size):
    x = find(x, link)
    y = find(y, link)
    if size[x] < size[y]:
        x,y = swap(x,y)
    if x != y:
        size[x] += size[y]
        link[y] = x


def sieve(n): 
    prime = [True for i in range(n+1)] 
    p = 2
    while (p * p <= n): 
        if (prime[p] == True): 
            for i in range(p * p, n+1, p):
                prime[i] = False
        p += 1
    return prime


MAXN = int(1e5 + 5)
def spf_sieve():
    spf[1] = 1;
    for i in range(2, MAXN):
        spf[i] = i;
    for i in range(4, MAXN, 2):
        spf[i] = 2;
    for i in range(3, ceil(MAXN ** 0.5), 2):
        if spf[i] == i:
            for j in range(i*i, MAXN, i):
                if spf[j] == j:
                    spf[j] = i;
    




def factoriazation(x):
    ret = {};
    while x != 1:
        ret[spf[x]] = ret.get(spf[x], 0) + 1;
        x = x//spf[x]
    return ret
    
    


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

def str_array():
    return input().strip().split();


MOD = int(1e9)+7;
CMOD = 998244353;
INF = float('inf'); NINF = -float('inf');



n, k = int_array(); a = int_array();
i = 0; j = k;
while(j < n):
    if a[j] > a[i]:
        print('Yes');
    else:
        print('No');
    i += 1; j += 1;

Solution (Python):
def main():
    N, K = tuple(int(c) for c in input().split(' '))
    A = [1] + list(int(c) for c in input().split(' '))

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

if __name__ == "__main__":
    main()

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

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

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

for i in range(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] > 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("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(['No','Yes'][A[i-K]<A[i]])

Solution (Python):
import sys












stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

def solve():
    
    n,k = map(int, stdin.readline().rstrip().split())
    A = list(map(int, stdin.readline().rstrip().split()))
    
    
    
    
    for i in range(k,n+1):
        last = A[i-1]
        if i == k:
            pass
        else:
            fi = A[i-k-1]
            if fi < last:
                print("Yes")
            else:
                print("No")


if __name__ == '__main__':
    solve()

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

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

Solution (Python):
def main():
    import sys
    def input():
        return sys.stdin.readline()[:-1]
    X=list(map(int,input().split()))
    A=list(map(int,input().split()))
    N=X[0]
    K=X[1]
    j=0
    for i in range(N-K):
        j=i+K+1
        if A[i]<A[j-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(n - k):
    if a[i] < a[i+k]:
        print('Yes')
    else:
        print('No')

Solution (Python):
import sys

input = sys.stdin.readline

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

if __name__ == '__main__':
    main()

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

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

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


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

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 defaultdict,deque
from sys import stdin,setrecursionlimit
import heapq,bisect,math,itertools,string,queue,copy
setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, stdin.readline().split()))

N,K = inpl()
Als = inpl()

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

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

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

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


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


if __name__ == '__main__':
    main()

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

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(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+1,N+1):
    hl = A[i-1]/A[i-K-1]
    if hl >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 = 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():
    from collections import deque
    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")


resolve()

Solution (Python):

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

Solution (Python):
import bisect
import copy
import heapq
import sys
import itertools
import math
from functools import lru_cache
from collections import deque
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7 

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]


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


if __name__ == "__main__":
    main()

Solution (Python):
s1 = input().split()

N = int(s1[0])
K = int(s1[1])

s2 = input().split()

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

Solution (Python):

import sys
from collections import deque

YES = "Yes"  
NO = "No"  


def solve(N: int, K: int, A: "List[int]"):

    A = deque(A)
    a = deque()

    p = 1
    for i in range(K):
        t=A.popleft()
        a.append(t)
    
    for i in range(K, N):
        t = A.popleft()
        c = a.popleft()
        if t > c: print(YES)
        else: print(NO)
        a.append(t)

    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    A = [int(next(tokens)) for _ in range(N)]  
    solve(N, K, A)

if __name__ == '__main__':
    main()

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

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

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

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

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

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

cumsum = [0 for _ in range(N + 1)]
for i in range(N):
    cumsum[i + 1] = cumsum[i] + A[i]

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

    prev = cumsum[i] - cumsum[i - K]
    now = cumsum[i + 1] - cumsum[i - K + 1]
    if now > prev:
        print("Yes")
    else:
        print("No")

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

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

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

Solution (Python):
from collections import deque
n,k = map(int,input().split())
alist = list(map(int,input().split()))
frontque = deque(alist[:k])
backque =  deque(alist[k:])

for i in range(n-k):
    back = backque.popleft()
    front = frontque.popleft()
    if front < back:
        print('Yes')
    else:
        print('No')
    frontque.append(back)

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

j = 0
for i in arr[k:]:
	if i > arr[j]:print('Yes')
	else:print('No')
	j += 1

Solution (Python):









import os
import sys




def main():
    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")


if __name__ == "__main__":
    main()

Solution (Python):
from sys import exit
import math
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

n,k = mi()
a = li()

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

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
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n,k = map(int,readline().split())
a = list(map(int,readline().split()))
for i in range(n-k):
  chk = a[k+i]
  c = a[i]
  if chk > c:
    print('Yes')
  else:
    print('No')

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

res = []
for i in range(k, n):
    res.append(a[i-k] < a[i])


for b in res:
    if(b): print("Yes")
    else: print("No")

Solution (Python):


import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union








from collections import deque                 






















def main():
    Num = Union[int, float]
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input():  return sys.stdin.readline().rstrip()
    def ii():     return int(input())
    def isp():    return input().split()
    def mi():     return map(int, input().split())
    def mi_0():   return map(lambda x: int(x)-1, input().split())
    def lmi():    return list(map(int, input().split()))
    def lmi_0():  return list(map(lambda x: int(x)-1, input().split()))
    def li():     return list(input())
    def debug(x): print(x, file=sys.stderr)
    
    
    
    n, k = mi()
    L = lmi()

    buf = deque(L[:k])
    for i in range(k, n):
        head = buf.popleft()
        tail = L[i]
        if head < tail:
            print('Yes')
        else:
            print('No')
        buf.append(tail)


if __name__ == "__main__":
    main()

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

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

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

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

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

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



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    A = [int(next(tokens)) for _ in range(N)]  
    solve(N, K, A)

if __name__ == '__main__':
    main()

Solution (Python):
N, K = map(int, input().split())
a = [int(x) for x in input().split()]
a.insert(0,0)
for i in range(K,N):
    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')
    else:
        print('No')

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

a = list(map(lambda x: x - ma, a))

befscore = 1
score = 1
f = True
for i in range(n):
    score = score + a[i]

    if i >= k:
        score = int(score - a[i - k])
        if befscore >= score:
            print("No")
        else:
            print("Yes")

    befscore = score

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

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

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

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

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

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

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

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

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

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

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

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):
import sys
input = sys.stdin.readline




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

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

Solution (Python):
import sys

n, k = map(int, sys.stdin.readline().split())
a = list(map(int, sys.stdin.readline().split()))

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

Solution (Python):
import math

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

log_A = [math.log(a) for a in A]

evaluations = [0]*(N-K+1)
evaluations[0] = sum(log_A[:K])

for i in range(N-K):
    evaluations[i+1] = evaluations[i] - log_A[i] + log_A[K+i]
    
for i in range(N-K):
    if evaluations[i] < evaluations[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=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 = 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 = list(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):

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

for i in range(N):
    A[i]=math.log10(A[i])
max=0
for i in range(K):
    max+=A[i]
for i in range(K,N):
    if max<max-A[i-K]+A[i]:
        print("Yes")
        max=max-A[i-K]+A[i]
    else:
        print("No")

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

if __name__ == "__main__":
  resolve()

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

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(N: int, K: int, A: "List[int]"):
    for k in range(N-K):
        if A[k] < A[K+k]:
            print(YES)
        else:
            print(NO)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    A = [int(next(tokens)) for _ in range(N)]  
    solve(N, K, A)

if __name__ == '__main__':
    main()