Two players are playing a card game with a deck of pairwise distinct cards. For any two cards in the deck, it is known which one beats the other (it is possible that beats , beats , and beats ). The deck is distributed between the players in an arbitrary manner. In each turn, the players reveal the top card from their respective decks, and the player whose card beats the other player's card takes both cards and places them at the bottom of their deck in any order they choose. Prove that for any initial distribution of the cards, the players can agree on a strategy based on the known card strengths to ensure that one of the players will eventually be left without cards.