{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003e (This problem is really old\u0026amp;easy and any acmer who is good at math may solve it in second)\u003cbr\u003e As we know, math is both intangible and specific. Today you are going to solve the following math problem:\u003cbr\u003e Given one non-negative integer b, one positive number P and one positive integer M, how many n could you find to satisfy the following 2 rules?\u003cbr\u003e\u003ccenter\u003e\u003cimg style\u003d\"max-width:100%;\" src\u003d\"CDN_BASE_URL/10af93fd45e86e795564a65b9b157811?v\u003d1714913120\"\u003e\u003c/center\u003e\u003cbr\u003e Here n! means n factorial , 0!\u003d1,1!\u003d1,2!\u003d2,3!\u003d6…,n!\u003d(n-1)!*n\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u0026nbsp;\u0026nbsp;In the first line of the input , we have one integer T indicating the number of test cases. (1 \u0026lt;\u003d T \u0026lt;\u003d 20)\u003cbr\u003e\u0026nbsp;\u0026nbsp;Then T cases follows.\u003cbr\u003e \u0026nbsp;\u0026nbsp;For every case, only 3 integers (b, P and M) in a single line. ( 0\u0026lt;\u003db\u0026lt;P, 1\u0026lt;\u003dP\u0026lt;\u003d10^5, 1 \u0026lt;\u003d M \u0026lt;\u003d2^64 – 1 )"}},{"title":"Output","value":{"format":"HTML","content":" For each test case, first you should print \"Case #x: \" in a line, where x stands for the case number started with 1. Then one integer indicates the number of \"n\" that you can find. "}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3\r\n1 2 3\r\n2 3 4\r\n3 4 5\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase #1: 2\r\nCase #2: 0\r\nCase #3: 0\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}