Dot Time

You are given a sequence of integers $A_1, A_2, \ldots, A_N$ and an integer $M$. For any valid integers $p, q$, let's define $F(p, q)$ as the dot product of the subsequences $A_p, A_{p+1}, \ldots, A_{p+M-1}$ and $A_q, A_{q+1}, \ldots, A_{q+M-1}$, i.e. $F(p, q) = \sum_{i=0}^{M-1} A_{p+i} \cdot A_{q+i}$. You should process $Q$ queries. In each query: - You are given two integers $pos$ and $va