{"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\"\u003eGiven 5 integers: a, b, c, d, k, you\u0027re to find x in a...b, y in c...d that GCD(x, y) \u003d k. GCD(x, y) means the greatest common divisor of x and y. Since the number of choices may be very large, you\u0027re only required to output the total number of different number pairs.\u003cbr\u003ePlease notice that, (x\u003d5, y\u003d7) and (x\u003d7, y\u003d5) are considered to be the same.\u003cbr\u003e\u003cbr\u003e\u003cb\u003eYoiu can assume that a \u003d c \u003d 1 in all test cases.\u003c/b\u003e\u003cbr\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The input consists of several test cases. The first line of the input is the number of the cases. There are no more than 3,000 cases.\u003cbr\u003eEach case contains five integers: a, b, c, d, k, 0 \u0026lt; a \u0026lt;\u003d b \u0026lt;\u003d 100,000, 0 \u0026lt; c \u0026lt;\u003d d \u0026lt;\u003d 100,000, 0 \u0026lt;\u003d k \u0026lt;\u003d 100,000, as described above.\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"For each test case, print the number of choices. Use the format in the example.\u003cbr\u003e"}},{"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\u003e2\r\n1 3 1 5 1\r\n1 11014 1 14409 9\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1: 9\r\nCase 2: 736427\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Hint","value":{"format":"HTML","content":"For the first sample input, all the 9 pairs of numbers are (1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (2, 3), (2, 5), (3, 4), (3, 5)."}}]}