#include <bits/stdc++.h>
using namespace std;
long long lvl1(long long x) {
  long long lvl = 0;
  long long p = x;
  while (p != 0) {
    p /= 2;
    lvl++;
  }
  return lvl;
}
long long f(long long x, long long k) {
  long long m = 1;
  long long lvl = lvl1(x);
  lvl--;
  k = (k % (m << lvl) + (m << lvl)) % (m << lvl);
  if (x + k >= (m << (lvl + m))) {
    x = x + k - (m << lvl);
  } else if (x + k < (m << lvl))
    x = x + k + (m << lvl);
  else
    x += k;
  return x;
}
long long f1(long long x, long long k) {
  long long lvl = lvl1(x), m = 1;
  lvl--;
  k = (k % (m << lvl) + (m << lvl)) % (m << lvl);
  if (x - k >= (m << (lvl + m))) {
    x = x - k - (m << lvl);
  } else if (x - k < (m << lvl))
    x = x - k + (m << lvl);
  else
    x -= k;
  return x;
}
unordered_map<long long, long long> s;
int main() {
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int t;
    cin >> t;
    if (t == 1) {
      long long x, k;
      cin >> x >> k;
      s[lvl1(x)] += k;
    } else if (t == 3) {
      long long x;
      cin >> x;
      cout << x << ' ';
      x = f(x, s[lvl1(x)]);
      x /= 2;
      while (x != 0) {
        cout << f1(x, s[lvl1(x)]) << ' ';
        x /= 2;
      }
      cout << endl;
    } else if (t == 2) {
      long long x, k;
      cin >> x >> k;
      long long lvl = lvl1(x);
      for (int j = lvl; j <= 100; j++) {
        s[j] += k;
        k *= 2;
      }
      int a = 0;
    }
  }
}
