#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=3e6+5;
int n,p; 
ll inv[N];
ll iv(){
	inv[1]=1;
	for(int i=2;i<=N;i++)
	    inv[i]=(p-p/i)*inv[p%i]%p;
}
int main(){
	cin>>n>>p;
	iv();
	for(int i=1;i<=n;i++) cout<<inv[i]<<endl;
	return 0;
}

本地没问题，不开O2也是RE