【模板】乘法逆元 - 洛谷https://www.luogu.com.cn/problem/P3811
ll inv[MAXN];
int main() {
ll n, p;
inv[1] = 1;
scanf("%lld %lld", &n, &p);
printf("1\n");
for (ll i = 2; i <= n; i++) {
inv[i] = (p - p / i) * inv[p % i] % p;
printf("%lld\n", inv[i]);
}
return 0;
}