求助 SCP2025-S 初赛模拟 T16

#include <iostream>
using namespace std;
const int maxn = 10000000 + 7;
int n, f[maxn], g[maxn];
long long m, ans = 1;
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> f[i];
  }
  for (int i = 1; i <= n; i++) {
    if(f[i] == 1)
      for (int j = i; j <= n; j += i)
        g[j] = 1;
    if(g[i] == 0)
      ans = ans * i % m;
  }
  cout << ans << endl;
  return 0;
}