#include <stdio.h>

 #include <string.h>

 #define lson cur << 1

 #define rson cur << 1 | 1

 const int maxn = ;

 struct node

 {

     int pid;

     int loop;

     int tag;

 }tree[maxn];

 int n, i, k;

 void build(int cur, int d)

 {

     if(d == n)

         return;

     tree[lson].loop = d;

     tree[lson].pid = k;

     tree[lson].tag = ++k;

     build(lson, d+);

     tree[rson].loop = d;

     tree[rson].tag = ++k;

     tree[rson].pid = tree[cur].pid;

     build(rson, d+);

 }

 void dfs(int cur, int d, int flag)

 {

     if(cur >= maxn) return;

     if(d+ == tree[cur].tag)

     {

         if(flag)

             printf("Loop %d: Process ID=%d\n", tree[cur].loop, tree[cur].pid);

         else

             printf("Process ID=%d, A=%d\n", tree[cur].tag, (tree[cur].loop + ) * );

         return ;

     }

     dfs(lson, d, flag);

     dfs(rson, d, flag);

 }

 int main()

 {

     int t;

     scanf("%d", &t);

     while(t--)

     {

         memset(tree, , sizeof tree);

         k = ;

         scanf("%d%d", &n, &i);

         tree[].loop = , tree[].pid = k, tree[].tag = ++k;

         build(, );

         dfs(, (i+) >> , i & );

     }

     return ;

 }