Please help on this problem:

We denote the function F by:

\begin{cases} F(x) = 1 & x\leq 2 \\ F(x) = F(x — 1) + F(x — 2) + x & x > 2 \end{cases}

Given q (1 ≤ q ≤ 10⁵) queries. The queries are characterized by two numbers l, r (1 ≤ l ≤ r ≤ 10⁹). Find:

Hello Codeforces community!

Please help on this problem:

Given array with length N (1 ≤ N ≤ 10⁵, 1 ≤ a_i ≤ 10⁹). And given Q queries(1 ≤ Q ≤ 10⁵). For each query given one number X. (1 ≤ X ≤ 10¹⁴). Find number of subarrays which sum equals to X.

Sorry for my poor English.