B"You are given two arrays a_0, a_1, ldots, a_{n - 1} and b_0, b_1, ldots, b_{m-1} , and an integer c . Compute the following sum: sum_{i=0}^{n-1} sum_{j=0}^{m-1} a_i b_j c^{i^2 ,j^3} Since it's value can be really large, print it modulo 490019 . First line contains three integers n , m and c ( 1 <= n, m <= 100 ,000 , 1 <= c < 490019 ). Next line contains exactly n integers a_i and defines the array a ( 0 <= a_i <= 1000 ). Last line contains exactly m integers b_i and defines the array b ( 0 <= b_i <= 1000 ). Print one integer -- value of the sum modulo 490019 . In the first example, the only non-zero summand corresponds to i = 1 , j = 1 and is equal to 1 cdot 1 cdot 3^1 = 3 . In the second example, all summands are equal to 1 . "...