Let's consider the famous game called Boom (aka Hat) with simplified rules. There are n teams playing the game. Each team has two players. The purpose of the game is to explain the words to the teammate without using any words that contain the same root or that sound similarly. Player j from team i (1 ≤ i ≤ n , 1 ≤ j ≤ 2) is characterized by two numbers: a ij and b ij . The numbers correspondingly represent the skill of explaining and the skill of understanding this particular player has. Besides, m cards are used for the game. Each card has a word written on it. The card number k (1 ≤ k ≤ m ) is characterized by number c k — the complexity of the word it contains. Before the game starts the cards are put in a deck and shuffled. Then the teams play in turns like that: the 1-st player of the 1-st team, the 1-st player of the 2-nd team, ... , the 1-st player of the n -th team, the 2-nd player of the 1-st team, ... , the 2-nd player of the n -th team, the 1-st player of the 1-st team and so on. Each turn continues for t seconds. It goes like that: Initially the time for each turn is t . While the time left to a player is more than 0, a player takes a card from the top of the deck and starts explaining the word it has to his teammate. The time needed for the j -th player of the i -th team to explain the word from the card k to his teammate (the q -th player of the i -th team) equals max (1, c k - ( a ij + b iq ) - d ik ) (if j = 1, then q = 2, else q = 1 ). The value d ik is the number of seconds the i -th team has already spent explaining the word k during the previous turns. Initially, all d ik equal 0. If a team manages to guess the word before the end of the turn, then the time given above is substracted from the duration of the turn, the card containing the guessed word leaves the game, the team wins one point and the game continues. If the team doesn't manage to guess the word, then the card is put at the bottom of the deck, d ik increases on the amount