#include <bits/stdc++.h>
using namespace std;
long long int pw[61];
long long int offset[61];
long long int modu(long long int x) {
  if (x < 0) return (-x);
  return x;
}
long long int signum(long long int x) {
  if (x < 0) return -1;
  if (x > 0) return 1;
  return 0;
}
int findLevel(long long int x) {
  int res = 0;
  while (x > 1) {
    x /= 2;
    res++;
  }
  return res;
}
long long int findPos(int h, long long int x) {
  long long int pos = pw[h] + ((x - pw[h] - offset[h]) % pw[h] + pw[h]) % pw[h];
  return pos;
}
void printAnc(long long int x) {
  long long int pos;
  int h = findLevel(x);
  pos = pw[h] + ((x - pw[h] + offset[h]) % pw[h] + pw[h]) % pw[h];
  while (h >= 0) {
    long long int y = findPos(h, pos);
    h--;
    pos /= 2;
    printf("%lld ", y);
  }
  printf("\n");
}
int main() {
  int q, t, h;
  long long int x, k;
  pw[0] = 1;
  for (int i = 1; i < 61; i++) pw[i] = pw[i - 1] * 2;
  cin >> q;
  memset(offset, 0, sizeof(offset));
  for (int i = 0; i < q; i++) {
    scanf("%d", &t);
    switch (t) {
      case 1:
        scanf("%lld %lld", &x, &k);
        h = findLevel(x);
        offset[h] += (signum(k) * ((modu(k) % pw[h])));
        offset[h] = signum(offset[h]) * ((modu(offset[h]) % pw[h]));
        break;
      case 2:
        scanf("%lld %lld", &x, &k);
        h = findLevel(x);
        for (int j = h; j < 61; j++) {
          k = signum(k) * (modu(k) % pw[j]);
          offset[j] += k;
          offset[h] = signum(offset[h]) * ((modu(offset[h]) % pw[h]));
          if (j != 60) k *= 2;
        }
        break;
      case 3:
        scanf("%lld", &x);
        printAnc(x);
        break;
    }
  }
  return 0;
}
