Kortit I

def check_possible(n, a, b):
    if a + b > n or a > n or b > n:
        return False
    if n == 2 and ((a == 0 and b == 1) or (a == 1 and b == 0)):
        return False
    return True

def generate_game(n, a, b):
    if not check_possible(n, a, b):
        return None
    
    # Initialize arrays with the moves we'll make
    p1_moves = [0] * n
    p2_moves = [0] * n
    
    # Track which numbers we've used
    used1 = set()
    used2 = set()
    current_pos = 0
    
    # Handle p1 wins
    for _ in range(a):
        # Find highest unused number for p1
        for num in range(n, 0, -1):
            if num not in used1:
                p1_moves[current_pos] = num
                used1.add(num)
                break
        # Find lowest unused number for p2
        for num in range(1, n + 1):
            if num not in used2 and num < p1_moves[current_pos]:
                p2_moves[current_pos] = num
                used2.add(num)
                break
        current_pos += 1
    
    # Handle p2 wins
    for _ in range(b):
        # Find highest unused number for p2
        for num in range(n, 0, -1):
            if num not in used2:
                p2_moves[current_pos] = num
                used2.add(num)
                break
        # Find lowest unused number for p1
        for num in range(1, n + 1):
            if num not in used1 and num < p2_moves[current_pos]:
                p1_moves[current_pos] = num
                used1.add(num)
                break
        current_pos += 1
    
    # Handle remaining moves (ties)
    remaining = []
    for num in range(1, n + 1):
        if num not in used1:
            remaining.append(num)
    
    # Fill in the ties
    for num in remaining:
        p1_moves[current_pos] = num
        p2_moves[current_pos] = num
        current_pos += 1
    
    return p1_moves, p2_moves

# Read number of test cases
try:
    t = int(input().strip())
    # Process each test case
    for _ in range(t):
        try:
            # Read and parse the line for each test case
            line = input().strip()
            n, a, b = map(int, line.split())
            
            result = generate_game(n, a, b)
            if result is None:
                print("NO")
            else:
                p1_moves, p2_moves = result
                print("YES")
                print(" ".join(map(str, p1_moves)))
                print(" ".join(map(str, p2_moves)))
                
        except (ValueError, IndexError) as e:
            # Handle errors in test case input
            continue
            
except (ValueError, EOFError) as e:
    # Handle errors in reading number of test cases
    pass

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: WRONG ANSWER

Test 4

Group: 3

Verdict: WRONG ANSWER

Test 5

Group: 3

Verdict: WRONG ANSWER

Test 6

Group: 3

Verdict: WRONG ANSWER

Test 7

Group: 3

Verdict: WRONG ANSWER

Test 8

Group: 3

Verdict: WRONG ANSWER

Test 9

Group: 3

Verdict: WRONG ANSWER

Test 10

Group: 3

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: WRONG ANSWER

Test 16

Group: 3

Verdict: WRONG ANSWER

Test 17

Group: 3

Verdict: WRONG ANSWER

Test 18

Group: 3

Verdict: WRONG ANSWER

Test 19

Group: 3

Verdict: WRONG ANSWER

Test 20

Group: 3

Verdict: WRONG ANSWER