{"trustable":true,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\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 type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eThis problem is very simple so the problem setters decided that its statement should be simple too. You are given two integers $$$n$$$ and $$$m$$$ such that $$$\\text{gcd}(n,\\,m) \\equiv 1$$$, and your task is to find the value of the function $$$\\text{F}(n,\\,m)$$$ as follows: \u003c/p\u003e\u003ccenter\u003e $$$\\text{F}(n,\\,m) \u003d \\text{gcd}(5^n + 7^n,\\,5^m + 7^m)$$$ \u003c/center\u003e\u003cp\u003eIn mathematics, the greatest common divisor (gcd) of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For example, the gcd of $$$8$$$ and $$$12$$$ is $$$4$$$.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line contains an integer $$$T$$$ ($$$1 \\le T \\le 10^5$$$) specifying the number of test cases.\u003c/p\u003e\u003cp\u003eEach test case consists of a single line contains two integers $$$n$$$ and $$$m$$$ ($$$1 \\le n, m \\le 10^9,\\, \\text{gcd}(n,\\,m) \\equiv 1$$$).\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each test case, print a single line containing the value of the function $$$\\text{F}(n,\\,m)$$$ as described in the statement.\u003c/p\u003e"}},{"title":"Examples","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\n2 3\n5 3\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\n12\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003eIn the first test case, the value of the function can be found as follow: $$$$$$\\text{F}(2,\\,3) \u003d \\text{gcd}(5^2 + 7^2,\\,5^3 + 7^3)$$$$$$ $$$$$$\\text{F}(2,\\,3) \u003d \\text{gcd}(74,\\, 468)$$$$$$ $$$$$$\\text{F}(2,\\,3) \u003d 2$$$$$$\u003c/p\u003e\u003cp\u003eIn the second test case, the value of the function can be found as follow: $$$$$$\\text{F}(5,\\,3) \u003d \\text{gcd}(5^5 + 7^5,\\,5^3 + 7^3)$$$$$$ $$$$$$\\text{F}(5,\\,3) \u003d \\text{gcd}(19932,\\, 468)$$$$$$ $$$$$$\\text{F}(5,\\,3) \u003d 12$$$$$$\u003c/p\u003e"}}]}