{"raw_statement":[{"iden":"problem statement","content":"Given is a sequence of length $N$: $A=(A_1,A_2,\\ldots,A_N)$, and an integer $K$.\nHow many of the contiguous subsequences of $A$ have the sum of $K$?  \nIn other words, how many pairs of integers $(l,r)$ satisfy all of the conditions below?\n\n*   $1\\leq l\\leq r\\leq N$\n*   $\\displaystyle\\sum_{i=l}^{r}A_i = K$"},{"iden":"constraints","content":"*   $1\\leq N \\leq 2\\times 10^5$\n*   $|A_i| \\leq 10^9$\n*   $|K| \\leq 10^{15}$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $K$\n$A_1$ $A_2$ $\\ldots$ $A_N$"},{"iden":"sample input 1","content":"6 5\n8 -3 5 7 0 -4"},{"iden":"sample output 1","content":"3\n\n$(l,r)=(1,2),(3,3),(2,6)$ are the three pairs that satisfy the conditions."},{"iden":"sample input 2","content":"2 -1000000000000000\n1000000000 -1000000000"},{"iden":"sample output 2","content":"0\n\nThere may be no pair that satisfies the conditions."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}