{"raw_statement":[{"iden":"statement","content":"Nicoleta received a box of candies from his sister. It has a rectangular shape with dimensions $1$ x $N$ and contains $N$ candies, and each one has a value $C_i$ of deliciousness.\n\nSanchola lives with Nicoleta in Revuocnav and he loves to make Nicoleta upset. Sanchola found out about the gift and decided to take a consecutive subsequence of candies from the box when Nicoleta is not looking. The total deliciousness taken by Sanchola should be at least L so that he can enjoy the candies, but not greater than R, to not raise suspicion.\n\nSanchola needs your help to calculate the number of distinct consecutive subsequences that he can take from Nicoleta.\n\nTwo consecutive subsequences $C_{l_1} \\\\\\\\cdots C_{r_1}$ and $C_{l_2} \\\\\\\\cdots C_{r_2}$ are considered equal if and only if they have the same number of candies $x$ and $forall k$ $C_{l_1 + k} = C_{l_2 + k}, 0 <= k < x$.\n\nThe first line consists of three integers $N$ $(1 <= N <= 5 * 10^5)$, $L$ and $R$ $(-10^(18) <= L <= R <= 10^(18))$ .\n\nThe second line contains $N$ integers $C_1, C_2, \\\\\\\\cdots, C_n$ ($-10^9 <= a_i <= 10^9$), indicating the deliciousness of each candy.\n\nOutput a single integer - The number of distinct consecutive subsequences whose sum is between $L$ and $R$.\n\n"},{"iden":"input","content":"The first line consists of three integers $N$ $(1 <= N <= 5 * 10^5)$, $L$ and $R$ $(-10^(18) <= L <= R <= 10^(18))$ .The second line contains $N$ integers $C_1, C_2, \\\\\\\\cdots, C_n$ ($-10^9 <= a_i <= 10^9$), indicating the deliciousness of each candy."},{"iden":"output","content":"Output a single integer - The number of distinct consecutive subsequences whose sum is between $L$ and $R$."},{"iden":"examples","content":"Input5 5 10\n1 2 3 4 5\nOutput7\nInput5 5 10\n1 2 3 4 4\nOutput6\n"}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ F_k $ denote the $ k $-th Fibonacci number, defined by:  \n$ F_1 = 1 $, $ F_2 = 1 $, and $ F_{k+2} = F_{k+1} + F_k $ for $ k \\geq 1 $.  \n\nLet $ n \\in \\mathbb{Z}^+ $ be given. Consider the set $ S_n = \\{ F_1, F_2, \\dots, F_n \\} $.  \n\n**Constraints**  \n$ 1 \\leq n \\leq 10^5 $\n\n**Objective**  \nCount the number of unordered pairs $ \\{x, y\\} \\subseteq S_n $ with $ x \\ne y $ such that $ \\gcd(x, y) = 1 $.","simple_statement":"Given n, count how many pairs (i, j) with 1 ≤ i < j ≤ n such that F_i + F_j is also a Fibonacci number.","has_page_source":false}