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.

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.

Savings AccountConsidering the new budget, Chef decided to keep all his money in a savings account.Chef has 𝑋X income sources where he gets 𝑌Y rupees from each source. However, due to bank restrictions, Chef can keep at most 𝑍Z rupees in the savings account.Find the minimum number of income sources Chef should reduce to maximise his savings without exceeding the account's limit.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of three space-separated integers 𝑋,𝑌,X,Y, and 𝑍Z — the number of income sources, amount received from each source and the maximum limit of savings account respectively.Output FormatFor each test case, output on a new line, the minimum number of income sources Chef should reduce to maximise his savings without exceeding the account's limit.Constraints1≤𝑇≤1041≤T≤10 4 1≤𝑋,𝑌≤101≤X,Y≤101≤𝑍≤1001≤Z≤100Sample 1:InputOutput31 2 42 4 63 10 12012Explanation:Test case 11: Chef can store a maximum of 44 rupees in his bank account. He has 11 income source from where he gets 22 rupees. Since the total income is not more than the limit of account, he does not need to decrease any income source.Test case 22: Chef can store a maximum of 66 rupees in his bank account. He has 22 income sources from where he gets 44 rupees each. Currently the total income is more than the limit of account.Chef will reduce one income source so that his total income becomes 44 rupees which lies within the limit of account.

Chef was driving on a highway at a speed of 𝑋X km/hour.To avoid accidents, there are fine imposed on overspeeding as follows:No fine if the speed of the car ≤70≤70 km/hour.Rs 500500 fine if the speed of the car is strictly greater than 7070 and ≤100≤100.Rs 20002000 fine if the speed of the car is strictly greater than 100100.Determine the fine Chef needs to pay.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 integer 𝑋X denoting the speed of Chef's car.Output FormatFor each test case, output the fine paid by Chef.Constraints1≤𝑇≤2001≤T≤2001≤𝑋≤2001≤X≤200Sample 1:InputOutput74011070100691018502000050002000500Explanation:Test case 11: The speed is ≤70≤70. Thus, Chef does not need to pay any fine.Test case 22: The speed is greater than 100100. Thus, Chef needs to pay 20002000 as fine.Test case 33: The speed is ≤70≤70. Thus, Chef does not need to pay any fine.Test case 44: The speed is greater than 7070 and ≤100≤100. Thus, Chef needs to pay 500500 as fine amount.Test case 55: The speed is ≤70≤70. Thus, Chef does not need to pay any fine.Test case 66: The speed is greater than 100100. Thus, Chef needs to pay 20002000 as fine.Test case 77: The speed is greater than 7070 and ≤100≤100. Thus, Chef needs to pay 500500 as fine amount.

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 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.