Problem: You have a simple and connected undirected graph consisting of n nodes and m edges.

Consider any way to pair some subset of these n nodes such that no node is present in more than one pair. 

This pairing is valid if for every pair of pairs, the induced subgraph containing all 4 nodes, two from each pair, has at most 2 edges (out of the 6 possible edges). More formally, for any two pairs, (a,b) and (c,d), the induced subgraph with nodes \\{a,b,c,d\} should have at most 2 edges. 

Please note that the subgraph induced by a set of nodes contains nodes only from this set and edges which have both of its end points in this set.

Now, do one of the following: 

  * Find a simple path consisting of at least ⌈ n/2 ⌉ nodes. Here, a path is called simple if it does not visit any node multiple times. 
  * Find a valid pairing in which at least ⌈ n/2 ⌉ nodes are paired. 



It can be shown that it is possible to find at least one of the two in every graph satisfying constraints from the statement. 

Input

Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 10^5). Description of the test cases follows.

The first line of each test case contains 2 integers n, m (2 ≤ n ≤ 5⋅ 10^5, 1 ≤ m ≤ 10^6), denoting the number of nodes and edges, respectively. 

The next m lines each contain 2 integers u and v (1 ≤ u, v ≤ n, u ≠ v), denoting that there is an undirected edge between nodes u and v in the given graph.

It is guaranteed that the given graph is connected, and simple — it does not contain multiple edges between the same pair of nodes, nor does it have any self-loops. 

It is guaranteed that the sum of n over all test cases does not exceed 5⋅ 10^5.

It is guaranteed that the sum of m over all test cases does not exceed 10^6.

Output

For each test case, the output format is as follows. 

If you have found a pairing, in the first line output "PAIRING" (without quotes). 

  * Then, output k (⌈ n/2 ⌉ ≤ 2⋅ k ≤ n), the number of pairs in your pairing. 
  * Then, in each of the next k lines, output 2 integers a and b — denoting that a and b are paired with each other. Note that the graph does not have to have an edge between a and b!
  * This pairing has to be valid, and every node has to be a part of at most 1 pair. 



Otherwise, in the first line output "PATH" (without quotes). 

  * Then, output k (⌈ n/2 ⌉ ≤ k ≤ n), the number of nodes in your path. 
  * Then, in the second line, output k integers, v_1, v_2, …, v_k, in the order in which they appear on the path. Formally, v_i and v_{i+1} should have an edge between them for every i (1 ≤ i < k).
  * This path has to be simple, meaning no node should appear more than once. 

Example

Input


4
6 5
1 4
2 5
3 6
1 5
3 5
6 5
1 4
2 5
3 6
1 5
3 5
12 14
1 2
2 3
3 4
4 1
1 5
1 12
2 6
2 7
3 8
3 9
4 10
4 11
2 4
1 3
12 14
1 2
2 3
3 4
4 1
1 5
1 12
2 6
2 7
3 8
3 9
4 10
4 11
2 4
1 3


Output


PATH
4 
1 5 3 6
PAIRING
2
1 6
2 4
PAIRING
3
1 8
2 5
4 10
PAIRING
4
1 7
2 9
3 11
4 5

Note

The path outputted in the first case is the following. 

<image>

The pairing outputted in the second case is the following. 

<image>

Here is an invalid pairing for the same graph — the subgraph \{1,3,4,5\} has 3 edges. 

<image>

Here is the pairing outputted in the third case. 

<image>

It's valid because — 

  * The subgraph \{1,8,2,5\} has edges (1,2) and (1,5). 
  * The subgraph \{1,8,4,10\} has edges (1,4) and (4,10). 
  * The subgraph \{4,10,2,5\} has edges (2,4) and (4,10). 



Here is the pairing outputted in the fourth case. 

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int head[500010], nxt[1000010 * 2], a[1000010 * 2], edge, size[500010],
    son[500010], dep[500010];
int tot, n, m, father[500010], cnt, p1[500010], p2[500010], tl, tr, bh[500010],
    cur;
int read() {
  int tmp = 0;
  char c = getchar();
  while (c < '0' || c > '9') {
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    tmp = tmp * 10 + c - '0';
    c = getchar();
  }
  return tmp;
}
void create(int u, int v) {
  edge++;
  a[edge] = v;
  nxt[edge] = head[u];
  head[u] = edge;
}
void clear() {
  for (int i = 1; i <= n; i++) head[i] = son[i] = dep[i] = 0;
  edge = tot = 0;
}
void get_res(int u) {
  puts("PATH");
  printf("%d\n", dep[u]);
  int cur = u;
  while (cur) {
    printf("%d ", cur);
    cur = father[cur];
  }
  puts("");
}
void dfs(int u, int fa) {
  father[u] = fa;
  dep[u] = dep[fa] + 1;
  size[u] = 1;
  int mx = 0;
  for (int i = head[u]; i; i = nxt[i]) {
    int v = a[i];
    if (dep[v] == 0) {
      dfs(v, u);
      size[u] += size[v];
      if (size[v] > mx) {
        mx = size[v];
        son[u] = v;
      }
    }
  }
}
void get_num(int u, int fa) {
  p2[++tl] = u;
  if (tl == tr) return;
  for (int i = head[u]; i; i = nxt[i]) {
    int v = a[i];
    if (father[v] == u) get_num(v, u);
    if (tl == tr) return;
  }
}
void get_bh(int u, int fa) {
  bh[++cur] = u;
  for (int i = head[u]; i; i = nxt[i]) {
    int v = a[i];
    if (father[v] == u) get_bh(v, u);
  }
}
void solve(int rt) {
  if (tr == cnt) {
    get_num(rt, father[rt]);
    return;
  }
  for (int i = head[rt]; i; i = nxt[i]) {
    int v = a[i];
    if (father[v] == rt && v != son[rt] && v != father[rt]) {
      cur = 0;
      get_bh(v, rt);
      int used = 0;
      while (tl < tr && used < cur) {
        used++;
        p2[++tl] = bh[used];
      }
      for (int i = used + 1; i <= cur; i++)
        if (tr < cnt) p1[++tr] = bh[i];
    }
  }
  solve(son[rt]);
}
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    n = read();
    m = read();
    for (int i = 1; i <= m; i++) {
      int u = read(), v = read();
      create(u, v);
      create(v, u);
    }
    dfs(1, 0);
    int flag = 0;
    for (int i = 1; i <= n; i++)
      if (dep[i] > (n + 1) / 2) {
        flag = 1;
        get_res(i);
        break;
      }
    cnt = (n + 1) / 2;
    cnt = (cnt + 1) / 2;
    tl = 0, tr = 0;
    if (flag == 0) {
      solve(1);
      puts("PAIRING");
      printf("%d\n", cnt);
      for (int i = 1; i <= cnt; i++) printf("%d %d\n", p1[i], p2[i]);
    }
    clear();
  }
}