Subsegments

题号：NC237451
时间限制：C/C++/Rust/Pascal 2秒，其他语言4秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld

题目描述

You are given an array of integers $a_1,a_2,\ldots,a_n$ and an integer $x$ .

Output the number of subsegments $[l,r]$ where $1 \le l \le r \le n$ such that $a_l \cdot a_{l+1}\cdot \ldots \cdot a_r \equiv x \mod 998,244,353$ .

输入描述:

The first line contains two integers  and  (, ).

The second line contains  numbers .

输出描述:

Output one integer, the answer.

示例1

输入

复制

10 6
2 3 2 1 6 2 3 2 1 7

输出

复制