{"trustable":false,"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\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027$$$$$$\u0027, right: \u0027$$$$$$\u0027, display: true},\n {left: \u0027$$$\u0027, right: \u0027$$$\u0027, display: false},\n {left: \u0027$$\u0027, right: \u0027$$\u0027, display: true},\n {left: \u0027$\u0027, right: \u0027$\u0027, display: false}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eAnda diberikan array $$$a$$$ dengan panjang $$$n$$$. Anda diminta untuk memproses kueri $$$q$$$ dengan format berikut: bilangan bulat $$$i$$$ dan $$$x$$$, kalikan $$$a_i$$$ dengan $$$x$ $$.\u003c/p\u003e\u003cp\u003eSetelah memproses setiap kueri, Anda perlu menampilkan \u003ca href\u003d\"https://en.wikipedia.org/wiki/Greatest_common_divisor\"\u003epembagi persekutuan terbesar (GCD)\u003c/a\u003e dari semua elemen array $$$a$$$.\u003c/p\u003e\u003cp\u003eKarena jawabannya mungkin terlalu besar, Anda diminta untuk mengeluarkannya modulo $$$10^9+7$$$.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eBaris pertama berisi dua bilangan bulat — $$$n$$$ dan $$$q$$$ ($$$1 \\le n, q \\le 2 \\cdot 10^5$$$).\u003c/p \u003e\u003cp\u003eBaris kedua berisi $$$n$$$ bilangan bulat $$$a_1, a_2, \\ldots, a_n$$$ ($$$1 \\le a_i \\le 2 \\cdot 10^5$$$) — elemen array $$$a$$$ sebelum perubahan.\u003c/p\u003e\u003cp\u003eBaris $$$q$$$ berikutnya berisi kueri dalam format berikut: setiap baris berisi dua bilangan bulat $$$i$$$ dan $$$x$$$ ($$$1 \\le i \\le n$$$, $$$1 \\le x \\le 2 \\cdot 10^5$$$).\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eCetak baris $$$q$$$: setelah memproses setiap kueri, keluaran GCD semua elemen modulo $$$10^9+7$$$ pada baris terpisah.\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\u003e4 3\n1 6 8 12\n1 12\n2 3\n3 3\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\n2\n6\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\u003eSetelah kueri pertama, arraynya adalah $$$[12, 6, 8, 12]$$$, $$$\\operatorname{gcd}(12, 6, 8, 12) \u003d 2$$$.\u003c /p\u003e\u003cp\u003eSetelah kueri kedua — $$$[12, 18, 8, 12]$$$, $$$\\operatorname{gcd}(12, 18, 8, 12) \u003d 2$$$. \u003c/p\u003e\u003cp\u003eSetelah kueri ketiga — $$$[12, 18, 24, 12]$$$, $$$\\operatorname{gcd}(12, 18, 24, 12) \u003d 6$$$ .\u003c/p\u003e\u003cp\u003eDi sini fungsi $$$\\operatorname{gcd}$$$ menunjukkan pembagi persekutuan terbesar.\u003c/p\u003e"}}]}