Kortit I

round_index = 0
player1_sequence = []
player2_sequence = []
p1_remaining_cards = []
p2_remaining_cards = []

def cardsA(j):
    global player2_sequence, player1_sequence, p1_remaining_cards, p2_remaining_cards, round_index
    for _ in range(j):
        for i in range(len(p2_remaining_cards)):
            found = False
            if p1_remaining_cards[-i] > p2_remaining_cards[0]:
                player1_sequence[round_index] = p1_remaining_cards.pop(-i)
                player2_sequence[round_index] = p2_remaining_cards.pop(0)
                round_index += 1
                found = True
                break
        if not found:
            raise IndexError("Couldn't find a card pair")

def cardsB(j):
    global player2_sequence, player1_sequence, p1_remaining_cards, p2_remaining_cards, round_index
    for _ in range(j):
        for i in range(len(p1_remaining_cards)):
            found = False
            if p2_remaining_cards[-i] > p1_remaining_cards[0]:
                player2_sequence[round_index] = p2_remaining_cards.pop(-i)
                player1_sequence[round_index] = p1_remaining_cards.pop(0)
                round_index += 1
                found = True
                break
        if not found:
            raise IndexError("Couldn't find a card pair")

def generate_game(n, a, b):
    if a + b > n or n == 0:
        raise IndexError("Just no.")

    global player1_sequence, player2_sequence, p1_remaining_cards, p2_remaining_cards, round_index
    
    player1_sequence = ["0"] * n
    player2_sequence = ["0"] * n

    available_cards = list(range(1, n + 1))
    round_index = 0
    draws = n - a - b
    p1_remaining_cards = available_cards
    p2_remaining_cards = available_cards

    # Round which end in a draw
    middle_index_start = (n - draws) // 2
    middle_cards = available_cards[middle_index_start:middle_index_start + draws]
    
    # taking the cards for the draws from the middle of the deck so both players can still win and lose
    p1_remaining_cards = [card for card in available_cards if card not in middle_cards]
    p2_remaining_cards = [card for card in available_cards if card not in middle_cards]
    
    for card in middle_cards:
        player1_sequence[round_index] = card
        player2_sequence[round_index] = card
        round_index += 1

    # starting with the smaller amount of wins
    if a < b:
        cardsA(a)
        cardsB(b)
    else:
        cardsB(b)
        cardsA(a)

    return player1_sequence, player2_sequence

def main():
    t = int(input())
    for _ in range(t):
        n, a, b = map(int, input().strip().split())
        try:
            p1_cards, p2_cards  = generate_game(n, a, b)

            print("YES")
            print(*p1_cards, sep=' ')
            print(*p2_cards, sep=' ')
        except IndexError:
            print("NO")
    return

if __name__ == "__main__":
        main()

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED

Test 4

Group: 3

Verdict: ACCEPTED

Test 5

Group: 3

Verdict: ACCEPTED

Test 6

Group: 3

Verdict: ACCEPTED

Test 7

Group: 3

Verdict: ACCEPTED

Test 8

Group: 3

Verdict: ACCEPTED

Test 9

Group: 3

Verdict: ACCEPTED

Test 10

Group: 3

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: ACCEPTED

Test 17

Group: 3

Verdict: ACCEPTED

Test 18

Group: 3

Verdict: ACCEPTED

Test 19

Group: 3

Verdict: ACCEPTED

Test 20

Group: 3

Verdict: ACCEPTED