On the occasion of Yoga Day, the only yoga instructor in Chefland, Chef, has received numerous queries.Chef has managed to free up 𝑁N hours from his busy schedule to conduct yoga sessions. There are two types of sessions that Chef offers:Type 11 session, which lasts 11 hour, and earns Chef 𝑋X rupees.Type 22 session, which lasts 22 hours, and earns Chef 𝑌 (𝑌>𝑋)Y (Y>X) rupees.Find the maximum amount of money Chef can earn in 𝑁N hours.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 𝑁,𝑋,𝑌N,X,Y — the number of hours for which Chef will take yoga sessions, price of type 11 session, and price of type 22 session respectively.Output FormatFor each test case, output on a new line, the maximum amount of money Chef can earn in 𝑁N hours.Constraints1≤𝑇≤10001≤T≤10001≤𝑁≤10001≤N≤10001≤𝑋<𝑌≤1001≤X<Y≤100Sample 1:InputOutput34 5 73 1 25 2 620314Explanation:Test case 11: Chef will take type 11 sessions for all 44 hours. Thus, in 44 hours, he can take 44 sessions earning a total of 4⋅5=204⋅5=20 rupees.Test case 22: Chef will take one session of type 11 and one session of type 22. Thus, in 33 hours, he earns a total of 1⋅1+1⋅2=31⋅1+1⋅2=3 rupees.Test case 33: Chef will take one session of type 11 and two sessions of type 22. Thus, in 55 hours, he earns a total of 1⋅2+2⋅6=141⋅2+2⋅6=14 rupees.

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.

Yoga DaySurya Namaskar, also known as Sun Salutation, is a series of 1212 yoga poses performed in a sequence.Chef repeats this sequence of yoga poses multiple times during his session.Given that Chef has performed 𝑁N yoga poses, find the number of rounds of Surya Namaskar he completed during the session.Input FormatThe input will contain a single integer 𝑁N, denoting the number of yoga poses Chef performed during his session.Output FormatOutput the number of rounds of Surya Namaskar Chef completed during the session.Constraints1≤𝑁≤1001≤N≤100Sample 1:InputOutput554Explanation:Chef completed 44 rounds of Surya Namaskar comprising of 4⋅12=484⋅12=48 yoga poses.The fifth round was incomplete since Chef performed only 77 poses in that round.Sample 2:InputOutput110Explanation:Chef performed 1111 yoga poses whereas each Surya Namaskar consists of 1212 poses. Thus, he did not complete even 11 round of Surya Namaskar.Sample 3:InputOutput242Explanation:Since Chef performed 2424 yoga poses and each Surya Namaskar consists of 1212 poses, he completed 22 rounds of Surya Namaskar.

Chef wants to conduct a lecture for which he needs to set up an online meeting of exactly 𝑋X minutes.The meeting platform supports a meeting of maximum 3030 minutes without subscription and a meeting of unlimited duration with subscription.Determine whether Chef needs to take a subscription or not for setting up the meet.Input FormatFirst line will contain 𝑇T, the number of test cases. Then the test cases follow.Each test case contains a single integer 𝑋X - denoting the duration of the lecture.Output FormatFor each test case, print in a single line, YES if Chef needs to take the subscription, 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≤𝑇≤1001≤T≤1001≤𝑋≤1001≤X≤100Sample 1:InputOutput45033080YESNONOYESExplanation:Test Case 11: Without subscription, the platform allows only 3030 minutes of duration. Since Chef needs to conduct a lecture of 5050 minutes, he needs to buy the subscription.Test Case 22: Without subscription, the platform allows 3030 minutes of duration. Since Chef needs to conduct a lecture of 33 minutes only, he does not need to buy the subscription.Test Case 33: Without subscription, the platform allows 3030 minutes of duration. Since Chef needs to conduct a lecture of 3030 minutes only, he does not need to buy the subscription.Test Case 44: Without subscription, the platform allows only 3030 minutes of duration. Since Chef needs to conduct a lecture of 8080 minutes, he needs to buy the subscription.

Chef and Instant NoodlesChef has invented 11-minute Instant Noodles. As the name suggests, each packet takes exactly 11 minute to cook.Chef's restaurant has 𝑋X stoves and only 11 packet can be cooked in a single stove at any minute.How many customers can Chef serve in 𝑌Y minutes if each customer orders exactly 11 packet of noodles?Input FormatThe first and only line of input contains two space-separated integers 𝑋X and 𝑌Y — the number of stoves and the number of minutes, respectively.Output FormatPrint a single integer, the maximum number of customers Chef can serve in 𝑌Y minutesConstraints1≤𝑋,𝑌≤10001≤X,Y≤1000Sample 1:InputOutput3 721Explanation:Chef cooks for 𝑌=7Y=7 minutes and can cook 𝑋=3X=3 packets per minute, one on each stove.So, the total number of packets that can be cooked is 𝑋⋅𝑌=3⋅7=21X⋅Y=3⋅7=21.Each person orders one packet, so the maximum number of customers that can be served is 2121.

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.