Chef is on his way to become the new big bull of the stock market but is a bit weak at calculating whether he made a profit or a loss on his deal.Given that Chef bought the stock at value 𝑋X and sold it at value 𝑌Y. Help him calculate whether he made a profit, loss, or was it a neutral deal.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of a single line of input containing two space-separated integers 𝑋X and 𝑌Y, denoting the value at which Chef bought and sold the stock respectively.Output FormatFor each test case, output PROFIT if Chef made a profit on the deal, LOSS if Chef incurred a loss on the deal, and NEUTRAL otherwise.The checker is case-insensitive so answers like pROfiT, profit, and PROFIT would be considered the same.Constraints1≤𝑇≤5001≤T≤5001≤𝑋,𝑌≤1001≤X,Y≤100Sample 1:InputOutput44 28 83 42 1LOSSNEUTRALPROFITLOSSExplanation:Test case 11: Since the cost price is greater than the selling price, Chef made a loss in the deal.Test case 22: Since the cost price is equal to the selling price, the deal was neutral.Test case 33: Since the cost price is less than the selling price, Chef made a profit in the deal.Test case 44: Since the cost price is greater than the selling price, Chef made a loss in the deal.

Chef and his girlfriend went on a date. Chef took 𝑋X dollars with him, and was quite sure that this would be enough to pay the bill. At the end, the waiter brought a bill of 𝑌Y dollars. Print "YES" if Chef has enough money to pay the bill, or "NO" if he has to borrow from his girlfriend and leave a bad impression on her.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of a single line of input, containing two space-separated integers 𝑋X and 𝑌Y.Output FormatFor each test case, output on a new line "YES" if Chef has enough money to pay the bill and "NO" otherwise.You may print each character of the string in either uppercase or lowercase (for example, the strings "yEs", "yes", "Yes" and "YES" will all be treated as identical).Constraints1≤𝑇≤1001≤T≤1001≤𝑋,𝑌≤1001≤X,Y≤100Sample 1:InputOutput41 11 22 150 100YESNOYESNOExplanation:Test case 11: Since the money Chef has is equal to the bill, he will be able to pay the bill.Test case 22: Since the money Chef has is less than the bill, he will have to borrow from his girlfriend and leave a bad impression on her.Test case 33: Since the money Chef has is greater than the bill, he will be able to pay the bill.Test case 44: Since the money Chef has is less than the bill, he will have to borrow from his girlfriend and leave a bad impression on her.

Chef is eagerly waiting for a piece of information. His secret agent told him that this information would be revealed to him after 𝐾K weeks.𝑋X days have already passed and Chef is getting restless now. Find the number of remaining days Chef has to wait for, to get the information.It is guaranteed that the information has not been revealed to the Chef yet.Input FormatThe first line of input will contain an integer 𝑇T — the number of test cases. The description of 𝑇T test cases follows.The first and only line of each test case contains two space-separated integers 𝐾K and 𝑋X, as described in the problem statement.Output FormatFor each test case, output the number of remaining days that Chef will have to wait for.Constraints1≤𝑇≤5001≤T≤5001≤𝐾≤101≤K≤101≤𝑋<7⋅𝐾1≤X<7⋅KSample 1:InputOutput41 51 61 11 22165Explanation:Test case 11: The information will be revealed to the Chef after 11 week, which is equivalent to 77 days. Chef has already waited for 55 days, so he needs to wait for 22 more days in order to get the information.Test case 22: The information will be revealed to the Chef after 11 week, which is equivalent to 77 days. Chef has already waited for 66 days, so he needs to wait for 11 more day in order to get the information.Test case 33: The information will be revealed to the Chef after 11 week, which is equivalent to 77 days. Chef has already waited for 11 day, so he needs to wait for 66 more days in order to get the information.Test case 44: The information will be revealed to the Chef after 11 week, which is equivalent to 77 days. Chef has already waited for 22 days, so he needs to wait for 55 more days in order to get the information.

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.

Chef has finally decided to complete all of his pending assignments.There are 𝑋X assignments where each assignment takes 𝑌Y minutes to complete.Find whether Chef would be able to complete all the assignments in 𝑍Z days.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists three space-separated integers 𝑋,𝑌,X,Y, and 𝑍Z — the number of assignments, time taken in minutes to complete each assignment, and the number of days in which Chef wants to complete the assignments.Output FormatFor each test case, output on a new line, YES, if Chef would be able to complete all the assignments in 𝑍Z days. Otherwise, print NO.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≤𝑇≤1051≤T≤10 5 1≤𝑋,𝑌≤1001≤X,Y≤1001≤𝑍≤101≤Z≤10Sample 1:InputOutput35 5 550 80 220 72 1YESNOYESExplanation:Test case 11: Chef needs a total of 5⋅5=255⋅5=25 minutes to complete all the assignments. Thus, he would be able to complete the assignments in 55 days.Test case 22: Chef needs a total of 50⋅80=400050⋅80=4000 minutes to complete all the assignments. However, in 22 days, he only has 2⋅24⋅60=28802⋅24⋅60=2880 minutes.Thus, he would not be able to complete the assignments in 22 days.Test case 33: Chef needs a total of 20⋅72=144020⋅72=1440 minutes to complete all the assignments. In 11 days, he has 24⋅60=144024⋅60=1440 minutes.Thus, he would be able to complete the assignments in 11 day.

Chef had collected 𝑁N notes of Rs. 20002000 to pay his total college fees. However, the government banned Rs. 20002000 notes.Chef wants to pay the same amount using Rs. 500500 notes only. Find the number of notes Chef needs.Input FormatEach test case consists of a single integer 𝑁N - the number of notes of Rs. 20002000 that Chef has collected.Output FormatOutput a single integer - the number of Rs. 500500 notes needed.Constraints1≤𝑁≤1001≤N≤100Sample 1:InputOutput416Explanation:44 notes of Rs. 20002000 make a total of 4⋅2000=80004⋅2000=8000 rupees. This is equivalent to 1616 notes of Rs. 500500.