原题链接:https://www.luogu.org/problemnew/show/P3811
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll inv[3000006];
int n,p;
int main(){
scanf("%d%d",&n,&p);
inv[1] = 1;
for(int i=2;i<=n;i++){
inv[i] = (p-p/i)*inv[p%i] % p;
}
for(int i=1;i<=n;i++){
printf("%lld\n",inv[i]);
}
return 0;
}