B"While roaming the mystic areas of Stonefalls, in order to drop legendary loot, an adventurer was given a quest as follows. He was given an array A = {a_1,a_2,...,a_N } of length N , and a number K . Define array B as B(q, A) = { q-a_1, q-a_2, ..., q-a_N }. Define function F as F(B,K) being sum of products of all K -tuples of elements in array B . For example, if the array B is [2,3,4,5] , and with K=3 , sum of products of all 3-tuples is F(B, 3) = 2*3*4+2*3*5+3*4*5+2*4*5 He was then given a number Q, number of queries of two types: All changes are temporarily made to initial array, and don't propagate to following queries. Help the adventurer calculate the answer to a quest, and finally get that loot! In the first two lines, numbers N ( 1 <= q N <= q 2*10^4 ) and K ( 1 <= q K <= q N ), the length of initial array A , and tuple size, followed by a_1,a_2,a_3, xe2 x80 xa6,a_N ( 0 <= q a_i <= q 10^9 ) , elements of array A , in the next line. Then follows number Q ( Q <= q 10 ), number of queries. In the next Q lines come queries of the form: as explained above ( 0 <= q q, d <= q 10^9, 1 <= q i,L,R <= q N ) Print Q lines, the answers to queries, modulo 998244353 . In the first query array A = [1, 2, 3, 4, 5], B = [5, 4, 3, 2, 1], sum of products of 2-tuples = 85. In second query array A = [1, 2, 3, 4, 2], B = [5, 4, 3, 2, 4], sum of products of 2-tuples = 127 In third query array A = [1, 3, 4, 4, 5], B = [5, 3, 2, 2, 1], sum of products of 2-tuples = 63 "...