{"trustable":false,"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":"在数学中,两个或多个整数(当其中至少有一个不为零时)的最大公约数(gcd),也称为最大公因数(gcf)、最高公因数(hcf)或最大公约数(gcm),是除数不带余数的最大正整数。\n---维基百科\n今天,GCD向你复仇。你得算出X和y的第k次GCD。"}},{"title":"Input","value":{"format":"HTML","content":"第一行包含一个整数T,表示测试用例的数量。\n\n每个测试用例只包含三个整数X、Y和K。\n\n【技术规范】\n\u003cbr\u003e1. 1 \u0026lt;\u003d T \u0026lt;\u003d 100\n\u003cbr\u003e2. 1 \u0026lt;\u003d X, Y, K \u0026lt;\u003d 1 000 000 000 000\n\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"对于每个测试用例,输出X和y的第k个GCD。如果不存在这样的整数,输出-1。"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e3\n2 3 1\n2 3 2\n8 16 3\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e1\n-1\n2\u003c/pre\u003e"}}]}