#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const double eps = 1e-9;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5 + 5;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
inline int read() {
  int x = 0, f = 0;
  char ch = getchar();
  while (ch < '0' || '9' < ch) f |= ch == '-', ch = getchar();
  while ('0' <= ch && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return f ? -x : x;
}
long long p1[70], p2[70];
void do1(long long x, long long k) {
  int lev = 0;
  while ((x >> lev) > 1) lev++;
  p1[lev] += k;
}
void do2(long long x, long long k) {
  int lev = 0;
  while ((x >> lev) > 1) lev++;
  p2[lev] += k;
}
void print(long long x) {
  int lev = 0;
  while ((x >> lev) > 1) lev++;
  long long mo = (1LL << lev);
  printf("%I64d", x);
  x = (x + p1[lev]) % mo;
  while (x < mo) x += mo;
  x = (x + p2[lev]) % mo;
  while (x < mo) x += mo;
  while (lev) {
    x >>= 1;
    lev--;
    mo = (1LL << lev);
    long long y = (x - p1[lev]) % mo;
    while (y < mo) y += mo;
    x = (x + p2[lev]) % mo;
    while (x < mo) x += mo;
    printf(" %I64d", y);
  }
  puts("");
}
int main() {
  memset(p1, 0, sizeof(p1));
  memset(p2, 0, sizeof(p2));
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    long long op, x, k;
    scanf("%lld", &op);
    if (op == 1) {
      scanf("%lld%lld", &x, &k);
      do1(x, k);
    } else if (op == 2) {
      scanf("%lld%lld", &x, &k);
      do2(x, k);
    } else {
      scanf("%lld", &x);
      print(x);
    }
  }
  return 0;
}
