#include <bits/stdc++.h>
using namespace std;
long long shi[65] = {0}, son[65];
void init() {
  long long i;
  son[1] = 1;
  for (i = 2; i < 65; i++) {
    son[i] = son[i - 1] + son[i - 1];
  }
}
int H(long long X) {
  int cnt = 0;
  while (X) {
    cnt++;
    X >>= 1;
  }
  return cnt;
}
void find_root(int F, long long pos) {
  if (F == 0) return;
  long long A = pos / 2;
  pos -= shi[F];
  if (pos < 0)
    pos += son[F];
  else
    pos %= son[F];
  printf("%lld ", son[F] + pos);
  find_root(F - 1, A);
}
int main(void) {
  init();
  long long Q, T, X, F;
  scanf("%lld", &Q);
  while (Q--) {
    scanf("%lld", &T);
    if (T == 3) {
      scanf("%lld", &X);
      F = H(X);
      find_root(F, X - son[F] + shi[F]);
      printf("\n");
    } else if (T == 2) {
      scanf("%lld %lld", &X, &T);
      F = H(X);
      for (; F < 65; F++) {
        T = T % son[F] + son[F];
        shi[F] += T;
        if (shi[F] >= son[F]) shi[F] %= son[F];
        T *= 2;
      }
    } else {
      scanf("%lld %lld", &X, &T);
      F = H(X);
      T = T % son[F] + son[F];
      shi[F] += T;
      if (shi[F] < 0)
        shi[F] += son[F];
      else if (shi[F] >= son[F])
        shi[F] %= son[F];
    }
  }
}
