You have a full binary tree having infinite levels.

Each node has an initial value. If a node has value x, then its left child has value 2·x and its right child has value 2·x + 1. 

The value of the root is 1. 

You need to answer Q queries. 

There are 3 types of queries: 

  1. Cyclically shift the values of all nodes on the same level as node with value X by K units. (The values/nodes of any other level are not affected).
  2. Cyclically shift the nodes on the same level as node with value X by K units. (The subtrees of these nodes will move along with them).
  3. Print the value of every node encountered on the simple path from the node with value X to the root.



Positive K implies right cyclic shift and negative K implies left cyclic shift. 

It is guaranteed that atleast one type 3 query is present.

Input

The first line contains a single integer Q (1 ≤ Q ≤ 105).

Then Q queries follow, one per line: 

  * Queries of type 1 and 2 have the following format: T X K (1 ≤ T ≤ 2; 1 ≤ X ≤ 1018; 0 ≤ |K| ≤ 1018), where T is type of the query.
  * Queries of type 3 have the following format: 3 X (1 ≤ X ≤ 1018).

Output

For each query of type 3, print the values of all nodes encountered in descending order.

Examples

Input

5
3 12
1 2 1
3 12
2 4 -1
3 8


Output

12 6 3 1 
12 6 2 1 
8 4 2 1 


Input

5
3 14
1 5 -3
3 14
1 3 1
3 14


Output

14 7 3 1 
14 6 3 1 
14 6 2 1 

Note

Following are the images of the first 4 levels of the tree in the first test case:

Original: 

<image>

After query 1 2 1: 

<image>

After query 2 4 -1: 

<image>
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-8;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const int maxn = 60 + 10;
int Q;
long long T, X, K;
long long Num[maxn], shift[maxn];
int level(long long x) {
  int ans = 0;
  while (x) {
    x /= 2;
    ans++;
  }
  return ans;
}
int main() {
  for (int i = 1; i <= 60; i++) Num[i] = 1LL << (i - 1);
  scanf("%d", &Q);
  while (Q--) {
    scanf("%I64d", &T);
    if (T == 1) {
      scanf("%I64d%I64d", &X, &K);
      int dep = level(X);
      shift[dep] += K;
    } else if (T == 2) {
      scanf("%I64d%I64d", &X, &K);
      long long now = 1;
      for (int dep = level(X); dep <= 60; dep++) {
        shift[dep] += K * now;
        now *= 2;
      }
    } else {
      scanf("%I64d", &X);
      for (int dep = level(X); dep >= 1; dep--) {
        printf("%I64d%c", X, dep == 1 ? '\n' : ' ');
        if (dep == 1) break;
        long long mov = (shift[dep] % Num[dep] + Num[dep]) % Num[dep];
        long long now = ((X - Num[dep]) + mov) % Num[dep] + Num[dep];
        X = now / 2;
        mov = ((-shift[dep - 1]) % Num[dep - 1] + Num[dep - 1]) % Num[dep - 1];
        now = ((X - Num[dep - 1]) + mov) % Num[dep - 1] + Num[dep - 1];
        X = now;
      }
    }
  }
  return 0;
}
