Chef and Brain SpeedIn ChefLand, human brain speed is measured in bits per second (bps). Chef has a threshold limit of 𝑋X bits per second above which his calculations are prone to errors. If Chef is currently working at 𝑌Y bits per second, is he prone to errors?If Chef is prone to errors print YES, otherwise print NO.Input FormatThe only line of input contains two space separated integers 𝑋X and 𝑌Y — the threshold limit and the rate at which Chef is currently working at.Output FormatIf Chef is prone to errors print YES, 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≤X,Y≤100Sample 1:InputOutput7 9YESExplanation:Chef's current brain speed of 99 bps is greater than the threshold of 77 bps, hence Chef is prone to errors.

Chef wants to run at least 10001000 meters to reach his fitness goal.There's a rectangular park nearby, with a length of 𝑋X meters and a width of 𝑌Y meters.Can Chef complete his goal by running one loop around the park? (Loop meaning running the entire path around the edge of the park.)Input FormatThe only line of input will contain 22 space-separated integers 𝑋X and 𝑌Y, the length and the width of the rectangular park.Output FormatPrint "YES" if Chef will be able to complete his fitness goal, otherwise print "NO" (without quotes).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≤X,Y≤1000Sample 1:InputOutput400 100YESExplanation:The perimeter of the ground is (400+100+400+100)=1000𝑚(400+100+400+100)=1000m which is sufficient to complete Chef's morning run.Sample 2:InputOutput300 150NOExplanation:The perimeter of the ground is (300+150+300+150)=900𝑚(300+150+300+150)=900m which is not sufficient to complete Chef's morning run.

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.

Election HopesThe elections in Chefland have concluded, and the results are in!Chef received 𝑋X votes, and his rival Chefu received 𝑌Y.Chef thinks he dominated the election if and only if he received at least double the number of votes Chefu received.Did Chef dominate the election?Input FormatThe only line of input contains two space-separated integers 𝑋X and 𝑌Y — the number of votes received by Chef and Chefu, respectively.Output FormatPrint a single line containing the answer: either "Yes" or "No" (without quotes), depending on whether Chef dominated the election or not.

Chef has recently moved into an apartment. It takes 3030 minutes for Chef to reach office from the apartment.Chef left for the office 𝑋X minutes before Chef was supposed to reach. Determine whether or not Chef will be able to reach on time.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.Output FormatFor each test case, output YES if Chef will reach on time, NO otherwise.The output is case-insensitive. Thus, the strings YES, yes, yeS, and Yes are all considered the same.Constraints1≤𝑇≤601≤T≤601≤𝑋≤601≤X≤60Sample 1:InputOutput6306014293142YESYESNONOYESYESExplanation:Test case 1: Chef leaves 3030 minutes before he is supposed to reach, so he will reach the office exactly on time since it takes 3030 minutes to commute.Test case 2: Chef will reach 3030 minutes early.Test case 3: Chef will reach 16 minutes late.

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.