#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;
  struct S {
    unsigned int new_m, x;
  };
  int ok_len = 0;
  vector<S> st;
  rep(_, q) {
    int t;
    cin >> t;
    if (t == 1) {
      unsigned int m, r;
      cin >> m >> r;
      internal::barrett bt(m);
      unsigned int c = 1, s = 0;
      for (auto [new_m, x] : st | views::reverse) {
        c = bt.mul(c, new_m);
        s = bt.mul(s, new_m) + x;
      }
      // s + c * x = r (mod m)
      r = (r + m - s % m) % m;
      auto [g, ic] = internal::inv_gcd(c, m);
      if (r % g) {
        st.emplace_back(0, 0);
        continue;
      }
      if (ok_len == ssize(st)) ok_len++;
      m /= g;
      c /= g;
      r /= g;
      st.emplace_back(m, r * ic % m);
    } else if (t == 2) {
      int k;
      cin >> k;
      rep(_, k) st.pop_back();
      chmin(ok_len, int(st.size()));
    } else {
      unsigned int m;
      cin >> m;
      if (ok_len != ssize(st)) {
        cout << -1 << '\n';
        continue;
      }
      internal::barrett bt(m);
      unsigned int s = 0;
      for (auto [new_m, x] : st | views::reverse) {
        s = bt.mul(s, new_m) + x;
      }
      s %= m;
      cout << s << '\n';
    }
  }
}