#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int q;
  cin >> q;
  unordered_map<int, int> pe;
  struct S {
    int new_m, x;
    vector<P> new_pe;
  };
  vector<S> st{{1, 0, {}}};
  rep(_, q) {
    int t;
    cin >> t;
    if (t == 1) {
      int m, r;
      cin >> m >> r;
      if (st.back().new_m == 0) {
        st.push_back({0, 0, {}});
        continue;
      }
      int c = 1;
      for (const auto& [new_m, x, _] : st) {
        r = (r - (ll)c * x) % m;
        c = (ll)c * new_m % m;
      }
      // c * x = r (mod m)
      auto [g, ic] = internal::inv_gcd(c, m);
      if (r % g) {
        st.push_back({0, 0, {}});
        continue;
      }
      int mm = m / g;
      c /= g;
      r /= g;
      int x = (ll)r * ic % mm;
      if (x < 0) x += mm;
      vector<P> new_pe;
      for (int p = 2; p * p <= m; p++) {
        int e = 0;
        while (m % p == 0) m /= p, e++;
        if (!e) continue;
        int pre = pe[p];
        if (e > pre) {
          pe[p] = e;
          new_pe.emplace_back(p, e - pre);
        }
      }
      if (m != 1) {
        int p = m, e = 1;
        int pre = pe[p];
        if (e > pre) {
          pe[p] = e;
          new_pe.emplace_back(p, e - pre);
        }
      }
      int new_m = 1;
      for (auto [p, e] : new_pe) {
        rep(_, e) new_m *= p;
      }
      st.emplace_back(new_m, x, new_pe);
    } else if (t == 2) {
      int k;
      cin >> k;
      rep(_, k) {
        for (auto [p, e] : st.back().new_pe) pe[p] -= e;
        st.pop_back();
      }
    } else {
      int m;
      cin >> m;
      if (st.back().new_m == 0) {
        cout << -1 << '\n';
        continue;
      }
      int c = 1, r = 0;
      for (const auto& [new_m, x, _] : st) {
        r = (r + (ll)c * x) % m;
        c = (ll)c * new_m % m;
      }
      cout << r << '\n';
    }
  }
}