---{"category_name":"school","problem_code":"COMPCAND","problem_name":"Can You Eat It","problemComponents":{"constraints":"- $1 \\leq T \\leq 10^{5}$\n- $0 \\leq N \\leq 10^{6}$\n- $1 \\leq K \\leq 10^{6}$\n","constraintsState":true,"subtasks":"","subtasksState":false,"inputFormat":"- First line will contain $T$, number of testcases. Then the testcases follow.\n- Each testcase contains of two spaced integers $N$, $K$.\n\n","inputFormatState":true,"outputFormat":"For each testcase, print the minimum number of bites you need to eat the complete candy. Print $-1$ if it is\nnot possible to do so.\n\n","outputFormatState":true,"sampleTestCases":{"0":{"id":1,"input":"3\n3 1\n3 2\n0 3\n","output":"3\n-1\n0\n","explanation":"**Test case 1:**\nWhen you eat your first bite of length $1$, the length of the candy will become $2$. After the second bite, the candy\u0027s length will be $1$ and finally after the third bite, candy\u0027s length will be $0$, and hence you eat the entire candy!\n\n**Test case 2:**\nAfter the first bite, candy\u0027s length will become $1$. You cannot go for the second bite as candy\u0027s length is positive and less than $2$.\n\n**Test case 3:** \nCandy\u0027s length is already $0$, hence it can be said that you have eaten the entire candy!","isDeleted":false}}},"video_editorial_url":"https://youtu.be/v_dfZJQk16M","languages_supported":{"0":"CPP14","1":"C","2":"JAVA","3":"PYTH 3.6","4":"CPP17","5":"PYTH","6":"PYP3","7":"CS2","8":"ADA","9":"PYPY","10":"TEXT","11":"PAS fpc","12":"NODEJS","13":"RUBY","14":"PHP","15":"GO","16":"HASK","17":"TCL","18":"PERL","19":"SCALA","20":"LUA","21":"kotlin","22":"BASH","23":"JS","24":"LISP sbcl","25":"rust","26":"PAS gpc","27":"BF","28":"CLOJ","29":"R","30":"D","31":"CAML","32":"FORT","33":"ASM","34":"swift","35":"FS","36":"WSPC","37":"LISP clisp","38":"SQL","39":"SCM guile","40":"PERL6","41":"ERL","42":"CLPS","43":"ICK","44":"NICE","45":"PRLG","46":"ICON","47":"COB","48":"SCM chicken","49":"PIKE","50":"SCM qobi","51":"ST","52":"SQLQ","53":"NEM"},"max_timelimit":0.5,"source_sizelimit":50000,"problem_author":"need_for_code","problem_tester":"","date_added":"19-11-2021","tags":{"0":"need_for_code"},"problem_difficulty_level":"Unavailable","best_tag":"","editorial_url":"https://discuss.codechef.com/problems/COMPCAND","time":{"view_start_date":1637951400,"submit_start_date":1637951400,"visible_start_date":1637951400,"end_date":1735669800},"is_direct_submittable":false,"problemDiscussURL":"https://discuss.codechef.com/search?q=COMPCAND","is_proctored":false,"visitedContests":{},"layout":"problem"}---This is an example statement in markdown. This is the statement of the problem [TANDC](https://codechef.com/problems/TANDC) on CodeChef. The main statement starts with the next paragraph. Please make sure to remove this paragraph from your statement before publishing your problem. If your problem doesn't contain Subtasks, you should remove the section subtask too. We are using markdown the syntax of which can be seen [at](https://github.com/showdownjs/showdown/wiki/Showdown's-Markdown-syntax). We request you to not use any HTML tags in the statement, e.g. no p, ul, li, pre, br or b tags. If you face any issue, please contact admins or email us at help@codechef.com.Tracy is teaching Charlie maths via a game called $N$-Cube, which involves three sections involving $N$.Tracy gives Charlie a number $N$, and Charlie makes a list of $N$-th powers of integers in increasing order $1^N, 2^N, 3^N, \dot, \text{so on}$. This teaches him exponentiation.Then Charlie performs the following subtraction game $N$ times: Take all pairs of consecutive numbers in the list and take their difference. These differences then form the new list for the next iteration of the game. Eg, if $N$ was 6, the list proceeds as $[1, 64, 729, 4096 ... ]$ to $[63, 685, 3367 ...]$, and so on $5$ more times.After the subtraction game, Charlie has to correctly tell Tracy the $N$-th element of the list. This number is the *value of the game*.After practice Charlie became an expert in the game. To challenge him more, Tracy will give two numbers $M$ (where $M$ is a prime) and $R$ instead of just a single number $N$, and the game must start from $M_R - 1$ instead of $N$. Since the *value of the game* can now become large, Charlie just have to tell the largest integer $K$ such that $M_K$ divides this number. Since even $K$ can be large, output $K$ modulo 1000000007 ($10^9 + 7$).<aside style='background: #f8f8f8;padding: 10px 15px;'><div>All submissions for this problem are available.</div></aside>