#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
// using mint = modint1000000007;
// using mint = double;
#endif

//define
using ll = __int128_t;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll , ll>;
using vi = vector<int>;
using vll = vector<long long>;

#define rep(i,l,r) for (int i = (int)(l); i < (int)(r); i++)
#define rrep(i,l,r) for (int i = (int)(r-1); i >= (int)(l); i--)
#define len(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define elif else if
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
const int inf = 1e9;
const long long infl = 1LL<<60;
const int mod = 998244353;
ll pow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; }
template<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; }
template <class T>
using spq = priority_queue<T, vector<T>, greater<T>>;

template<class T>istream& operator>>(istream& i, vector<T>& v) {for(int j = 0; j < (int)(v).size(); j++) i >> v[j]; return i;}
struct IoSetup {
    IoSetup() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(15);
    }
} iosetup;


ll extgcd(ll a, ll b, ll &x, ll &y) {
    if (b == 0) {
        x = 1; y = 0;
        return a;
    }
    ll d = extgcd(b, a % b, y, x);
    y -= (a / b) * x;
    return d;
}

int main() {
    int q; cin >> q;

    vector<pll> st;
    int ng = inf; 
    
    rep(i, 0, q) {
        int t; cin >> t;
        if (t == 1) {
            long long m_, r_; cin >> m_ >> r_; ll m = m_, r = r_;

            if (len(st) >= ng) {
                st.pb({0, 1});
                continue;
            }

            ll cr = 0, cm = 1;
            for (auto &p : st) {
                cr = (cr + cm * p.fi) % m;
                cm = cm * p.se % m;
            }

            ll a = cm;
            ll b = (r - cr % m + m) % m;
            ll x, y;
            ll g = extgcd(cm, m, x, y);

            if (b % g != 0) {
                ng = len(st);
                st.pb({0, 1});
            } else {
                m /= g;
                a /= g;
                b /= g;
                ll k = (b * x % m + m) % m;
                st.push_back({k, m});
            }
        } elif (t == 2) {
            int k;
            cin >> k;
            st.resize(len(st) - k);
            if (len(st) < ng) ng = inf;
        } elif (t == 3) {
            long long m_; cin >> m_; ll m = m_;
            if (len(st) >= ng) {
                cout << "-1\n";
            }else if(len(st) == 0){
                cout << "0\n";
            }else{
                ll cr = 0, cm = 1;
                for (auto &p : st) {
                    cr = (cr + cm * p.fi) % m;
                    cm = cm * p.se % m;
                }
                cout << (long long)((cr + m) % m) << "\n";
            }
        }
    }

    return 0;
}