{"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\u003e要成为Codeforces之王,Kuroni必须解决以下问题。\u003c/p\u003e\u003cp\u003e他获得了$$$n$$$个数$$$a_1, a_2, \\dots, a_n$$$。帮助Kuroni计算$$$\\prod_{1\\le i\u0026lt;j\\le n} |a_i - a_j|$$$。由于结果可能非常大,输出结果取模$$$m$$$。\u003c/p\u003e\u003cp\u003e如果你对简写符号不熟悉,$$$\\prod_{1\\le i\u0026lt;j\\le n} |a_i - a_j|$$$等于$$$|a_1 - a_2|\\cdot|a_1 - a_3|\\cdot$$$ $$$\\dots$$$ $$$\\cdot|a_1 - a_n|\\cdot|a_2 - a_3|\\cdot|a_2 - a_4|\\cdot$$$ $$$\\dots$$$ $$$\\cdot|a_2 - a_n| \\cdot$$$ $$$\\dots$$$ $$$\\cdot |a_{n-1} - a_n|$$$。换句话说,这是所有$$$1\\le i \u0026lt; j \\le n$$$的乘积$$$|a_i - a_j|$$$。\u003c/p\u003e"}},{"title":"输入","value":{"format":"HTML","content":"\u003cp\u003e第一行包含两个整数$$$n$$$,$$$m$$$($$$2\\le n \\le 2\\cdot 10^5$$$,$$$1\\le m \\le 1000$$$)— 数字的数量和取模数。\u003c/p\u003e\u003cp\u003e第二行包含$$$n$$$个整数$$$a_1, a_2, \\dots, a_n$$$($$$0 \\le a_i \\le 10^9$$$)。\u003c/p\u003e"}},{"title":"输出","value":{"format":"HTML","content":"\u003cp\u003e输出一个数字—$$$\\prod_{1\\le i\u0026lt;j\\le n} |a_i - a_j| \\bmod m$$$。\u003c/p\u003e"}},{"title":"示例1","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 10\n8 5\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e3\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e"}},{"title":"示例2","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 12\n1 4 5\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e0\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e"}},{"title":"示例3","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 7\n1 4 9\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e1\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e"}},{"title":"注意","value":{"format":"HTML","content":"\u003cp\u003e在第一个示例中,$$$|8 - 5| \u003d 3 \\equiv 3 \\bmod 10$$$。\u003c/p\u003e\u003cp\u003e在第二个示例中,$$$|1 - 4|\\cdot|1 - 5|\\cdot|4 - 5| \u003d 3\\cdot 4 \\cdot 1 \u003d 12 \\equiv 0 \\bmod 12$$$。\u003c/p\u003e\u003cp\u003e在第三个示例中,$$$|1 - 4|\\cdot|1 - 9|\\cdot|4 - 9| \u003d 3 \\cdot 8 \\cdot 5 \u003d 120 \\equiv 1 \\bmod 7$$$。\u003c/p\u003e"}}]}