In a temple, there were three beggars. A pilgrim came to the temple with few coins. The pujari of the temple gave him a magic bag in which coins get trippled each time you put that coins into it. He put all the coins he had in that bag and the coins got trippled. He took out all the coins and gave few to the first beggar and then again put the remaining coins back in the bag. The coins got trippled again; he took out all the coins again and gave few coins to the second beggar. He then again put the remaining coins in the bag and the coins got trippled again. He took out all the coins and gave few coins to third beggar. There were no coins left with him when he gave coins to third beggar and he gave equal number of coins to each beggar. How many coins did he gave to each beggar?

Famine in a village …. people became desperate with hunger ... there wasa rich man in the village …. he was very generous .... decided to feed thechildren with bread ….. everyday children came and fought hard to grabloaves of bread ….. a small girl waited patiently for her turn .... got thesmallest loaf in the end …. rich man was impressed by her patience ….thought of rewarding her ... kept Rs. 200. In the smallest loaf ... girl findsthe money and returns it to the rich man ... he is impressed with herhonesty … gives her Rs. 200 more

In a card game, the dealer distributes one card to each player. Each player then bets an amount on his card without looking at his card. After betting, the player shows his card. If the card is an ace, the dealer pays the player five times his bet. If the card is a king, the dealer pays the player four times his bet. If the card is a queen, the dealer pays the player three times the bet. If the card is any other card, the player has to forfeit his bet. If Mr. Crap Baggins is joining the game with Rs. 13000, how much money can he hope to have, when he leaves the game?Choices:- 14000 12000 13860 15540

Alice, Bob, and Confucius are bored during recess, so they decide to play a new game. Each of them puts a dollar in the pot, and each tosses a coin. Alice wins if the coins land all heads or all tails. Bob wins if two heads and one tail land, and Confucius wins if one head and two tails land. The coins are fair, and the winner receives a net payment of $2 ($3 - $1 = $2), and the losers lose their $1.

Once upon a time in the small town of Pairland, there was an annual lottery event that captivated the residents. The lottery involved N magical coins, each represented by two values (Ai, Bi), one on each side. The townsfolk eagerly awaited the grand lottery day, and the excitement was palpable. However, a mysterious condition was imposed on the lottery this year. Each participant had to swap the sides of some coin pairs, following a special operation: for the ith pair, Ai would become Bi , and Bi would become Ai. To add a twist to the event, the townspeople were given an intriguing challenge. They had to figure out if it was possible to perform these swaps in such a way that the sum of all the values on one side of the coins equaled a magical number, M. Your task is to create a question for participants in the magical lottery of Pairland. They must decide if it's possible to swap coin values in such a way that the sum of one side equals a magical number, M. If possible, print "YES"; otherwise, print "NO."Input FormatThe first line contains an integer T denoting the number of test cases. Description of each test case is as follows: The first line of each test case contains two space-seperated integers N and M denoting Number of Coins and the Magical Number respectively. The next N lines contains two space-seperated integers Ai and Bi denoting the ith pair.Constraints1 <= T <= 1001 <= N <= 10001 <= M <= 100001 <= Ai, Bi <= 1000Output FormatFor each test case, print YES, if it is possible to satisfy the given condition, otherwise print NO.Sample Input 032 54 105 12 32 14 34 193 71 46 93 6Sample Output 0YESNOYESExplanation 0For Testcase 1:You choose side containing 4 for coin 1 and side containing 1 for coin 2. Hence the answer is YES.For Testcase 2:You cannot get 3 by choosing any combination of sides, hence the answer is NO

Once upon a time in the small town of Pairland, there was an annual lottery event that captivated the residents. The lottery involved N magical coins, each represented by two values (Ai, Bi), one on each side. The townsfolk eagerly awaited the grand lottery day, and the excitement was palpable. However, a mysterious condition was imposed on the lottery this year. Each participant had to swap the sides of some coin pairs, following a special operation: for the ith pair, Ai would become Bi , and Bi would become Ai. To add a twist to the event, the townspeople were given an intriguing challenge. They had to figure out if it was possible to perform these swaps in such a way that the sum of all the values on one side of the coins equaled a magical number, M. Your task is to create a question for participants in the magical lottery of Pairland. They must decide if it's possible to swap coin values in such a way that the sum of one side equals a magical number, M. If possible, print "YES"; otherwise, print "NO."Input FormatThe first line contains an integer T denoting the number of test cases. Description of each test case is as follows: The first line of each test case contains two space-seperated integers N and M denoting Number of Coins and the Magical Number respectively. The next N lines contains two space-seperated integers Ai and Bi denoting the ith pair.Constraints1 <= T <= 1001 <= N <= 10001 <= M <= 100001 <= Ai, Bi <= 1000Output Format