#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

struct Fast {
  Fast() {
    std::cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(10);
  }
} fast;

#define all(a) (a).begin(), (a).end()
#define rep(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (a); i--)
using vi = vector<int>;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;

using mint = modint;
using vm = vector<mint>;
using vvm = vector<vm>;

ll safe_mod(ll a, ll b) {
  ll c = a % b;
  return c < 0 ? c + b : c;
}

ll ext_gcd(ll a, ll b, ll& x, ll& y) {
  for (ll u = y = 1, v = x = 0; a;) {
    ll q = b / a;
    swap(x -= q * u, u);
    swap(y -= q * v, v);
    swap(b -= q * a, a);
  }
  return b;
}

const int A_MAX = 1e9;
int lg;
ll k;
vvm basis, tmp;
vl cnt;

ll val1(const mint x) {
  ll v = x.val();
  return v == 0 ? k : v;
}
void add(vm& a, const vm& b) {
  rep(i, 0, b.size()) a[i] += b[i];
}
void mul(vm& a, mint n) {
  rep(i, 0, a.size()) a[i] = a[i] * n;
}
void add_mul(vm& a, const vm& b, mint n) {
  rep(i, 0, a.size()) a[i] += b[i] * n;
}

void query1(ll x) {
  int sz = 1;
  rep(i, 0, lg) tmp[0][i] = x % k, x /= k;
  rrep(i, 0, lg) {
    ll g = val1(basis[i][i]);
    vm v(sz), prod(sz + 1);
    rep(j, 0, sz) {
      ll p, y;
      g = ext_gcd(g, tmp[j][i].val(), p, y);
      prod[j] = p;
      v[j] = y;
    }
    rrep(j, 1, sz) prod[j - 1] *= prod[j];
    auto t = vm(basis[i]);
    mul(t, prod[0]);
    prod[sz] = 1;
    rep(j, 0, sz) add_mul(t, tmp[j], v[j] * prod[j + 1]);
    tmp[sz++] = vm(basis[i]);
    for (auto& b : tmp) add_mul(b, t, -val1(b[i]) / g);
    if (g != k) basis[i] = t;
  }
  rep(i, 0, lg) cnt[i + 1] = cnt[i] * (k / val1(basis[i][i]));
}

void query2(ll x) {
  if (x > cnt[lg]) {
    cout << -1 << "\n";
    return;
  }
  x--;
  vm v(lg, 0);
  rrep(i, 0, lg) {
    add_mul(v, basis[i], x / cnt[i] - v[i].val() / val1(basis[i][i]));
    x %= cnt[i];
  }
  ll ans = 0;
  rrep(i, 0, lg) ans = ans * k + v[i].val();
  cout << ans << "\n";
}

void query3(ll x) {
  x++;
  ll ans = 0;
  vl d(lg);
  rep(i, 0, lg) d[i] = x % k, x /= k;
  if (x) {
    cout << cnt[lg] << "\n";
    return;
  }
  vm y(lg, 0);
  rrep(i, 0, lg) {
    ll s = val1(basis[i][i]), r = val1(y[i]) % s;
    ans += (d[i] - r + s - 1) / s * cnt[i];
    if ((d[i] - r) % s) break;
    add_mul(y, basis[i], (d[i] - y[i].val()) / s);
  }
  cout << ans << "\n";
}

int main() {
  int q;
  cin >> k >> q;
  mint::set_mod(k);

  lg = 0;
  for (ll p = 1; p <= A_MAX; p *= k) lg++;
  basis = vvm(lg, vm(lg, 0));
  tmp = vvm(lg + 1, vm(lg, 0));
  cnt = vl(lg + 1, 1);

  while (q--) {
    int t;
    ll x;
    cin >> t >> x;
    if (t == 1) query1(x);
    if (t == 2) query2(x);
    if (t == 3) query3(x);
  }
}