求问exgcd求逆元

#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,p;
inline pair<int,int> exgcd(int a,int b,int c){
    if(b==0){
        int x=c/a,y=0;
        return {x,y};
    }
    auto [q,w]=exgcd(b,a%b,c);
    int x=w%p,y=q-((a/b)*w%p);
    return {x,y};
}
signed main(){
    cin>>n>>p;
    for(int i=1;i<=n;i++){
        cout<<exgcd(i,p,1).first<<"\n";
    }
}