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 is making cookies for 𝑁N kids. He wants to give everyone an equal number of cookies. He must give at least 11 cookie to each kid.Chef already has 𝑀M cookies.He can destroy or make 11 cookie in 11 second.Find the minimum time after which he can evenly distribute the cookies between all kids.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.The first and only line of each test case contains 𝑁N and 𝑀M - the number of kids and the initial number of cookies.Output FormatFor each test case, output on a new line the minimum time such that Chef can evenly distribute all his cookies.Constraints1≤𝑇≤1041≤T≤10 4 1≤𝑁,𝑀≤1091≤N,M≤10 9 Sample 1:InputOutput45 175 184 12 182230Explanation:Test Case 1 : Chef destroys 22 cookies to have 1515 cookies total. This takes 22 seconds. Now, he can distribute all his cookies by giving every kid 33 cookies each.Test Case 2 : Chef makes 22 cookies to have 2020 cookies total. This takes 22 seconds again. Now, he can distribute all his cookies by giving every kid 44 cookies each.Test Case 3 : Chef makes 33 more cookies to have 44 cookies total, and he gives 11 each to the 44 kids. Note that Chef can't destroy 11 cookie and then evenly distribute, as he needs to give everyone at least 11 cookie.

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.

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.

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