In Chefland, a football player gets 22 points for each goal and 11 point for each assist.Messi has 𝐴A goals and 𝐵B assists this season, whereas Ronaldo has 𝑋X goals and 𝑌Y assists.Find out the player with more points this season.Input FormatThe first and only line of input will contains four space-separated integers 𝐴A, 𝐵B, 𝑋X and 𝑌Y, the number of goals and assists that Messi has and the number of goals and assists that Ronaldo has, respectively.Output FormatPrint a single line containing:Messi, if Messi has more points than Ronaldo.Ronaldo, if Ronaldo has more points than Messi.Equal, if both have equal points.You can print each character in uppercase or lowercase. For example, the strings Messi, MESSI, messi, and MeSSi are considered identical.Constraints0≤𝐴,𝐵,𝑋,𝑌≤1000≤A,B,X,Y≤100Sample 1:InputOutput40 30 50 10EqualExplanation:Messi has 4040 goals and 3030 assists. Thus, his total points are 40⋅2+30=11040⋅2+30=110.Ronaldo has 5050 goals and 1010 assists. Thus, his total points are 50⋅2+10=11050⋅2+10=110.Both have 110110 points.Sample 2:InputOutput91 22 60 30 MessiExplanation:Messi has 9191 goals and 2222 assists. Thus, his total points are 91⋅2+22=20491⋅2+22=204.Ronaldo has 6060 goals and 3030 assists. Thus, his total points are 60⋅2+30=15060⋅2+30=150.Messi has 204204 points, whereas Ronaldo has 150150.Sample 3:InputOutput60 30 80 20RonaldoExplanation:Messi has 6060 goals and 3030 assists. Thus, his total points are 60⋅2+30=15060⋅2+30=150.Ronaldo has 8080 goals and 2020 assists. Thus, his total points are 80⋅2+20=18080⋅2+20=180.Messi has 150150 points, whereas Ronaldo has 180180.

Athletes of Chefland have won 𝐺G gold medals, 𝑆S silver medals, and 𝐵B bronze medals in the Paris Olympics.Chef will be happy only if the Chefland team wins 55 medals of each type. Find the total number of additional medals the team needs to win to make Chef happy.Input FormatThe first and only line of input will contain three space-separated integers 𝐺,𝑆,G,S, and 𝐵B — the number of gold, silver, and bronze medals, respectively.Output FormatFor each test case, output on a new line, the total number of additional medals the team needs to win to make Chef happy.Constraints1≤𝐺,𝑆,𝐵≤51≤G,S,B≤5Sample 1:InputOutput5 1 45Explanation:The team already has 55 gold medals. They need 44 silver medals and 11 bronze medal. Thus, a total of 55 medals are needed to make Chef happy.Sample 2:InputOutput2 1 111Explanation:The team needs 33 gold, 44 silver, and 44 bronze medals. Thus, they need a total of 1111 medals to make Chef happy.

Chef is playing a mobile game. In the game, Chef's character Chefario can perform special attacks. However, one special attack costs 𝑋X mana points to Chefario.If Chefario currently has 𝑌Y mana points, determine the maximum number of special attacks he can perform.Input FormatThe first line contains a single integer 𝑇T — the number of test cases. Then the test cases follow.The first and only line of each test case contains two space-separated integers 𝑋X and 𝑌Y — the cost of one special attack and the number of mana points Chefario has initially.Output FormatFor each test case, output the maximum number of special attacks Chefario can perform.Constraints1≤𝑇≤1051≤T≤10 5 1≤𝑋≤1001≤X≤1001≤𝑌≤10001≤Y≤1000Sample 1:InputOutput310 306 4150 2360Explanation:Test case 11: Chefario can perform a maximum of 33 special attacks which will cost him 3030 mana points.Test case 22: Chefario can perform a maximum of 66 special attacks which will cost him 3636 mana points. Note that Chefario can not perform 77 special attacks as these will cost him 4242 mana points while he has only 4141 mana points.Test case 33: Chefario will not be able to perform any special attacks in this case.

There are 𝑁N students including Chef in a school. The school bus has 𝑀M seats, and every student in the school travels on the bus.It is guaranteed that 𝑁≤𝑀N≤M, so that everyone will have a seat.Chef is happy when the school bus is not full.Given 𝑁N and 𝑀M, your task is to find out whether Chef will be happy.Input FormatThe only line of input will contain two space-separated integers 𝑁N and 𝑀M, denoting the number of students in the school and the number of seats in the school bus respectively.Output FormatFor each test case, output on a new line the answer: YES, if Chef will be happy, and NO otherwise.You may print each character of the string in uppercase or lowercase (for example, the strings YeS, yEs, yes, and YES will all be treated as identical).Constraints1≤𝑁≤𝑀≤101≤N≤M≤10Sample 1:InputOutput2 3YESExplanation:There are 22 students and 33 seats on the bus.So, there will be one empty seat on the bus and Chef will be happy.Sample 2:InputOutput6 6NOExplanation:There are 66 students and 66 seats on the bus.The bus will be full and Chef will not be happy.

In a football match, a penalty shootout is used to determine the winner if the score is tied after regulation and extra time. Each team takes turns attempting five penalty kicks.Team A has scored 𝑋X goals in 33 turns while team B has scored 𝑌Y goals in 44 turns.Determine if it's possible for the penalty shootout to end with equal score after both teams have taken all 55 of their penalty kicks.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of two space-separated integers 𝑋X and 𝑌Y — the number of goals scored by team A in 33 turns and team B in 44 turns respectively.Output FormatFor each test case, output on a new line YES if match can still end in draw, otherwise output NO.You may print each character of the output in either uppercase or lowercase (for example, the strings YES, yEs, yes, and yeS will all be treated as identical).Constraints1≤𝑇≤10001≤T≤10000≤𝑋≤30≤X≤30≤𝑌≤40≤Y≤4Sample 1:InputOutput31 23 01 1YESNOYESExplanation:Test case 11: Team A can score 11 and 00 goals in their 4𝑡ℎ4 th and 5𝑡ℎ5 th turn respectively and team B can score 00 goals in 5𝑡ℎ5 th turn.This way the final score of penalty for both teams would be 22.Test case 22: Even if team B scores a goal in 5𝑡ℎ5 th turn, their total would be 11, which is less than the score of team A.Test case 33: Team A can score 00 and 11 goal in their 4𝑡ℎ4 th and 5𝑡ℎ5 th turn respectively and team B can score 11 goal in 5𝑡ℎ5 th turn.

If you wanna party, if you, if you wanna partyThen put your hands upChef wants to host a party with a total of 𝑁N people.However, the party hall has a capacity of 𝑋X people. Find whether Chef can host the party.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of two space-separated integers 𝑁N and 𝑋X — the total number of people and the capacity of the party hall.Output FormatFor each test case, output on a new line, YES, if Chef can host the party and NO otherwise.Each character of the output may be printed in either uppercase or lowercase. That is, the strings NO, no, nO, and No will be treated as equivalent.Constraints1≤𝑇≤1001≤T≤1001≤𝑁,𝑋≤101≤N,X≤10Sample 1:InputOutput42 54 36 610 9YESNOYESNOExplanation:Test case 11: Chef wants to host a party with 22 people. Since the capacity of the hall is 55, he can host the party.Test case 22: Chef wants to host a party with 44 people. Since the capacity of the hall is 33, he can not host the party.Test case 33: Chef wants to host a party with 66 people. Since the capacity of the hall is 66, he can host the party.Test case 44: Chef wants to host a party with 1010 people. Since the capacity of the hall is 99, he can not host the party.