而后单调

def is_up_or_down(s):
    up = sorted(s)
    down = sorted(s,reverse=True)
    if up == s:
        return 1#up
    elif down == s:
        return 2#down
    else:
        return False
#s1 is up


def is_have_up(s1,s2):
    s2.sort()
    for i in range(len(s2)+1):
        if i == 0:
            if s1[-1] < s2[i]:
                return True
        elif i == len(s2):
            if s1[0] > s2[i-1]:
                return True
        else:
            if s2[i-1] < s1[0] and s1[-1] <s2[i]:
                return True
    return False

def is_have_down(s1,s2):
    s2.sort(reverse = True)
    for i in range(len(s2)+1):
        if i == 0:
            if s1[-1] > s2[i]:
                return True
        elif i == len(s2):
            if s1[0] < s2[i-1]:
                return True
        else:
            if s2[i-1] > s1[0] and s1[-1] > s2[i]:
                return True
    return False

def have_solution(s,m):
    if len(s) == m:
        if is_up_or_down(s):
            return 'YES'
        else:
            return 'NO'
    i = 0
    while i + m <= len(s):
        s_tichu = s[i:i + m]
        s_shenxia = s[:i] + s[i + m:]
        if is_up_or_down(s_tichu):
            if is_up_or_down(s_tichu) == 1:
                if is_have_up(s_tichu, s_shenxia):
                    return 'YES'
            elif is_up_or_down(s_tichu) == 2:
                if is_have_down(s_tichu, s_shenxia):
                    return 'YES'
        i += 1
    return 'NO'

n = int(input())
for k in range(n):
    a,b = map(int,input().split())
    shuzhu = list(map(int,input().split()))
    print(have_solution(shuzhu,b))
#有超时，力竭