Chef's set

import math

def is_valid_set(friend_set, remaining_set):
    for x in friend_set:
        for y in remaining_set:
            if math.gcd(x, y) != 1:
                return False
    return True

def solve():
    t = int(input())
    for _ in range(t):
        n, k = map(int, input().split())
        numbers = list(range(1, n + 1))
        found = False
        from itertools import combinations
        for combo in combinations(numbers, k):
            friend_set = set(combo)
            remaining_set = set(numbers) - friend_set
            if is_valid_set(friend_set, remaining_set):
                print("YES")
                print(" ".join(map(str, friend_set)))
                found = True
                break
        if not found:
            print("NO")

solve()