#include <bits/stdc++.h>
using namespace std;
long long int Move[65];
long long int Move2[65];
void op1(int f, long long int x, long long int k, long long int times) {
  if (x != 0) f = log2(x) + 1;
  long long int cnt = 1LL << (f - 1);
  k = ((k % cnt) * (times % cnt)) % cnt;
  Move[f] = (Move[f] + k + cnt) % cnt;
  Move2[f] = (Move2[f] - k + cnt) % cnt;
}
void op2(long long int x, long long int k) {
  int f = log2(x) + 1;
  for (int i = 0; f < 65; i++, f++) op1(f, 0, k, 1LL << i);
}
void op3(long long int x) {
  if (x == 1LL) {
    printf("1\n");
    return;
  }
  printf("%lld", x);
  int f = log2(x) + 1;
  long long int cnt = 1LL << (f - 1);
  long long int pos = ((x - cnt) + Move[f] + cnt) % cnt + cnt;
  while (!(pos == 3LL || pos == 2LL)) {
    if (pos & 1)
      pos = (pos - 1) >> 1;
    else
      pos = pos >> 1;
    f = log2(pos) + 1;
    cnt = 1LL << (f - 1);
    printf("% lld", (pos + (cnt - Move[f])) % cnt + cnt);
  }
  printf(" 1\n");
}
int main() {
  memset(Move, 0, sizeof(Move));
  memset(Move2, 0, sizeof(Move2));
  int t;
  scanf("%d", &t);
  while (t--) {
    int type;
    scanf("%d", &type);
    if (type == 1) {
      long long int x, k;
      scanf("%lld%lld", &x, &k);
      op1(-1, x, k, 1);
    } else if (type == 2) {
      long long int x, k;
      scanf("%lld%lld", &x, &k);
      op2(x, k);
    } else {
      long long int x;
      scanf("%lld", &x);
      op3(x);
    }
  }
  return 0;
}
