#include <bits/stdc++.h>
using namespace std;
template <typename T>
void out(T x) {
  cout << x << endl;
  exit(0);
}
const long long mod = 1e9 + 7;
const int maxn = 1e6 + 5;
long long getd(long long x) {
  long long d = 0;
  long long cur = 2;
  while (cur <= x) {
    cur = cur << 1LL;
    d++;
  }
  return d;
}
long long rot[maxn];
int q;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> q;
  assert(getd(1) == 0);
  assert(getd(5) == 2);
  while (q--) {
    int ty;
    cin >> ty;
    long long x;
    cin >> x;
    long long d = getd(x);
    long long mod = 1LL << d;
    if (ty == 3) {
      long long val = x;
      long long idx = val - mod;
      long long og_idx = (((idx + rot[d]) % mod) + mod) % mod;
      long long og_val = mod + og_idx;
      cout << val << " ";
      while (og_val > 1) {
        og_val = og_val / 2;
        long long d = getd(og_val);
        long long mod = 1LL << d;
        long long idx = og_val - mod;
        long long val = ((idx - rot[d] + mod) % mod) + mod;
        cout << val << " ";
      }
      cout << "\n";
    } else if (ty == 1) {
      long long k;
      cin >> k;
      rot[d] += k;
      rot[d] %= mod;
      rot[d] += mod;
      rot[d] %= mod;
    } else if (ty == 2) {
      long long k;
      cin >> k;
      for (long long j = d; j <= 61; j++) {
        long long mod = 1LL << j;
        long long totr = k;
        for (int w = d; w < j; w++) {
          totr *= 2LL;
          totr %= mod;
        }
        rot[j] += totr;
        rot[j] %= mod;
        rot[j] += mod;
        rot[j] %= mod;
      }
    }
  }
  return 0;
}
