If you wanna party, if you, if you wanna partyThen put your hands upChef wants to host a party with a total of 𝑁N people.However, the party hall has a capacity of 𝑋X people. Find whether Chef can host the party.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of two space-separated integers 𝑁N and 𝑋X — the total number of people and the capacity of the party hall.Output FormatFor each test case, output on a new line, YES, if Chef can host the party and NO otherwise.Each character of the output may be printed in either uppercase or lowercase. That is, the strings NO, no, nO, and No will be treated as equivalent.Constraints1≤𝑇≤1001≤T≤1001≤𝑁,𝑋≤101≤N,X≤10Sample 1:InputOutput42 54 36 610 9YESNOYESNOExplanation:Test case 11: Chef wants to host a party with 22 people. Since the capacity of the hall is 55, he can host the party.Test case 22: Chef wants to host a party with 44 people. Since the capacity of the hall is 33, he can not host the party.Test case 33: Chef wants to host a party with 66 people. Since the capacity of the hall is 66, he can host the party.Test case 44: Chef wants to host a party with 1010 people. Since the capacity of the hall is 99, he can not host the party.

There are 𝑁N students including Chef in a school. The school bus has 𝑀M seats, and every student in the school travels on the bus.It is guaranteed that 𝑁≤𝑀N≤M, so that everyone will have a seat.Chef is happy when the school bus is not full.Given 𝑁N and 𝑀M, your task is to find out whether Chef will be happy.Input FormatThe only line of input will contain two space-separated integers 𝑁N and 𝑀M, denoting the number of students in the school and the number of seats in the school bus respectively.Output FormatFor each test case, output on a new line the answer: YES, if Chef will be happy, and NO otherwise.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≤𝑁≤𝑀≤101≤N≤M≤10Sample 1:InputOutput2 3YESExplanation:There are 22 students and 33 seats on the bus.So, there will be one empty seat on the bus and Chef will be happy.Sample 2:InputOutput6 6NOExplanation:There are 66 students and 66 seats on the bus.The bus will be full and Chef will not be happy.

Chef and some of his friends are planning to participate in a puzzle hunt event.The rules of the puzzle hunt state:"This hunt is intended for teams of 66 to 88 people."Chef's team has 𝑁N people in total. Are they eligible to participate?Input FormatThe first and only line of input will contain a single integer 𝑁N: the number of people present in Chef's team.Output FormatPrint the answer: Yes if Chef's team is eligible to participate, and No otherwise.Each letter in the output may be printed in either uppercase or lowercase, i.e, the outputs NO, No, nO, no will all be treated as equivalent.Constraints1≤𝑁≤101≤N≤10Sample 1:InputOutput4NoExplanation:The puzzle hunt requires between 66 and 88 people in a team.44 isn't between 66 and 88, so Chef's team cannot participate.Sample 2:InputOutput7YesExplanation:Chef's team has 77 people, and 77 lies between 66 and 88.So, Chef's team can participate in the event.Sample 3:InputOutput8YesExplanation:Chef's team has 88 people, and 88 lies between 66 and 88.So, Chef's team can participate in the event.

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.

Candy DistributionChef has 𝑁N candies. He has to distribute them to exactly 𝑀M of his friends such that each friend gets equal number of candies and each friend gets even number of candies. Determine whether it is possible to do so.NOTE: Chef will not take any candies himself and will distribute all the candies.Input FormatFirst line will contain 𝑇T, number of test cases. Then the test cases follow.Each test case contains of a single line of input, two integers 𝑁N and 𝑀M, the number of candies and the number of friends.Output FormatFor each test case, the output will consist of a single line containing Yes if Chef can distribute the candies as per the conditions and No otherwise.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).

Remaining NeighborhoodsAs elections approach the country of Chefland, Chef's campaign is in full swing.Chef's city has exactly 100100 neighborhoods.Chef has already visited 𝑁N of them to canvass for votes, and he won't stop till he's visited every last one of them!How many more neighborhoods does Chef need to visit?Input FormatThe only line of input will contain a single integer 𝑁N, the number of neighborhoods Chef has already visited.Output FormatPrint a single integer: the number of neighborhoods Chef still needs to visit.Constraints0≤𝑁≤1000≤N≤100Sample 1:InputOutput7822Explanation:Chef has visited 7878 out of the 100100 neighborhoods. That leaves 2222 more for him to visit.Sample 2:InputOutput1000Explanation:Chef has visited every neighborhood already.