#include using namespace std; int main() { int n, q; cin>>n>>q; int a[n]; for (int i=0; i>a[i]; int mod = 998244353; long long dp[n+1]; for (int i=0; i<=n; i++) { dp[i] = 0; } dp[0] = a[0] - 1; dp[1] = 1; for (int i=1; i=1; j--) { dp[j] = dp[j] * (a[i] - 1); dp[j] %= mod; dp[j] += dp[j-1]; dp[j] %= mod; } dp[0] = dp[0] * (a[i] - 1); dp[0] %= mod; } for (int i=0; i>b; cout<