Problem Statement

A gaming platform has launched a new multi-player tournament. Each game of the tournament is played between two players and consists of exactly 3 rounds . Every player owns exactly three power boosters . Before a game starts, both players know each other's power boosters. In each round a player plays one of their own power boosters, and each power booster may be used at most once in a game — so across the three rounds each player plays each of their three boosters exactly once, in an order of their choosing. In a round, the player who plays the strictly higher power booster wins that round. If the two boosters played in a round are equal, neither player wins that round. Player X is said to be capable of defeating player Y if there exists an ordering of X 's power boosters and there exists an ordering of Y 's power boosters such that X wins at least 2 of the 3 rounds . Note that both orderings are chosen freely, so it is possible for X to be capable of defeating Y and for