code
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 3e6 + 100;
int inv[N], n, p;
void solve(int num){
inv[1] = 1;
for (int i = 2; i <= num; ++i) {
inv[i] = (long long)(p - p / i) * inv[p % i] % p;
}
}
int main(){
cin >> n >> p;
solve(n);
for (int i = 1; i <= n; ++i) {
printf("%d\n", inv[i]);
}
}