Div.1 doing todo list

Div.1 doing the problem todo Listfft

Http://codeforces.com/contest/986/problem/D
Can only think of is a maximum of two 2, the others are 3. But I don't know how to ask.
You can enumerate the number of 2 to find the approximate value of 3 numbers. Find the exact value around the approximate value.
The calculation can be multiplied by the matrix fast Power + FFT to calculate the large number.

Data

Http://codeforces.com/contest/986/problem/E
Do it by the prime number, sort the query, and then seem to increment each point one by one?
Because it also increases nlogc times, so the complexity is scientific.
To maintain the point-to-path information, there is something called the Euler tour tree.

Div.1 doing todo list