#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=15000;
ll s[maxn+5],p[maxn+5],q[maxn+5],s1[maxn+5];
ll cnt,lim;
ll gcd(ll a,ll b){
    return b?gcd(b,a%b):a;
}
ll egcd(ll a,ll b,ll &x,ll &y){
    ll d;
    if(b==0){
        x=1,y=0;
        return a;
    }
    d=egcd(b,a%b,y,x);
    y-=a/b*x;
    return d;
}
int main(){
    ll t,op,m,r,k,i,j,zc,zc1,zc2,cur,cur1,ans,x,y,d;
    scanf("%lld",&t);
    cnt=0,lim=0;
    while(t--){
        scanf("%lld",&op);
        if(op==1){
            scanf("%lld%lld",&m,&r);
            cnt++;
            s[cnt]=m,p[cnt]=r;
            if(cnt-1==lim){
                zc=m;
                for(i=1;i<cnt;i++){
                    zc/=gcd(zc,q[i]);
                }
                q[cnt]=zc;
                cur=1,zc1=0;
                for(i=1;i<cnt;i++){
                    zc1=(zc1+s1[i]*cur)%m;
                    cur=(cur*q[i])%m;
                }
                zc2=(r-zc1%m+m)%m;
                d=egcd(cur,m,x,y);
                if(zc2%d==0){
                    x=(x%m+m)%m;
                    s1[cnt]=(x*(zc2/d))%(m/d);
                    lim++;
                }
            }
        }
        else if(op==2){
            scanf("%lld",&k);
            cnt-=k;
            if(lim>cnt){
                lim=cnt;
            }
        }
        else{
            scanf("%lld",&m);
            if(lim<cnt){
                printf("-1\n");
            }
            else{
                ans=0,cur=1;
                for(i=1;i<=cnt;i++){
                    ans=(ans+s1[i]*cur)%m;
                    cur=(cur*q[i])%m;
                }
                printf("%lld\n",ans);
            }
        }
    }
    return 0;
}