#include <bits/stdc++.h>
using namespace std;
typedef pair<long long int, long long int> P;
const long long int OO = 1e18;
void fast() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
long long int q, x, t, k, sh[int(62)], g = 1, res;
P p[int(62)];
long long int lg(long long int y) {
  for (long long int i = 0; i <= 60; i++)
    if ((1LL << i) > y) return i - 1;
}
void shft(long long int y, long long int w) {
  sh[y] += w;
  bool ch = (sh[y] < 0);
  if (ch) sh[y] = -sh[y];
  sh[y] %= (1LL << y);
  if (ch) sh[y] = -sh[y];
}
int main() {
  for (long long int i = 0; i <= 60; i++) {
    p[i].first = (1LL << i), p[i].second = p[i].first * (2LL) - 1LL;
  }
  scanf("%lld", &q);
  while (q--) {
    scanf("%lld%lld", &t, &x);
    if (t == 1) {
      scanf("%lld", &k);
      shft(lg(x), k);
    } else if (t == 2) {
      scanf("%lld", &k);
      g = k;
      for (int i = lg(x); i <= 60; i++) shft(i, g), g *= 2LL;
    } else {
      g = lg(x);
      x += sh[g];
      if (x < p[g].first) {
        x -= p[g].first;
        x += p[g].second + 1;
      } else if (x > p[g].second) {
        x -= (p[g].second + 1);
        x += p[g].first;
      }
      while (g >= 0) {
        res = x;
        res -= sh[g];
        swap(x, res);
        if (x < p[g].first) {
          x -= p[g].first;
          x += p[g].second + 1;
        } else if (x > p[g].second) {
          x -= (p[g].second + 1);
          x += p[g].first;
        }
        swap(x, res);
        printf("%lld", res);
        if (g != 0)
          printf(" ");
        else
          printf("\n");
        g--;
        x /= 2;
      }
    }
  }
  return 0;
}
