Problem: Bob has a simple undirected connected graph (without self-loops and multiple edges). He wants to learn whether his graph is bipartite (that is, you can paint all vertices of the graph into two colors so that there is no edge connecting two vertices of the same color) or not. As he is not very good at programming, he asked Alice for help. He does not want to disclose his graph to Alice, but he agreed that Alice can ask him some questions about the graph.

The only question that Alice can ask is the following: she sends s — a subset of vertices of the original graph. Bob answers with the number of edges that have both endpoints in s. Since he doesn't want Alice to learn too much about the graph, he allows her to ask no more than 20000 questions. Furthermore, he suspects that Alice might introduce false messages to their communication channel, so when Alice finally tells him whether the graph is bipartite or not, she also needs to provide a proof — either the partitions themselves or a cycle of odd length.

Your task is to help Alice to construct the queries, find whether the graph is bipartite. 

Input

The first line contains a single integer n (1 ≤ n ≤ 600) — the number of vertices in Bob's graph.

Interaction

First, read an integer n (1≤ n≤ 600) — the number of vertices in Bob's graph.

To make a query, print two lines. First of which should be in the format "? k" (1 ≤ k ≤ n), where k is the size of the set to be queried. The second line should contain k space separated distinct integers s_1, s_2, ..., s_k (1 ≤ s_i ≤ n) — the vertices of the queried set.

After each query read a single integer m (0 ≤ m ≤ (n(n-1))/(2)) — the number of edges between the vertices of the set \\{s_i\}.

You are not allowed to ask more than 20000 queries.

If m = -1, it means that you asked more queries than allowed, or asked an invalid query. Your program should immediately terminate (for example, by calling exit(0)). You will receive Wrong Answer; it means that you asked more queries than allowed, or asked an invalid query. If you ignore this, you can get other verdicts since your program will continue to read from a closed stream.

After printing a query do not forget to print end of line and flush the output. Otherwise, you will get Idleness limit exceeded. To do this, use:

  * fflush(stdout) or cout.flush() in C++;
  * System.out.flush() in Java;
  * flush(output) in Pascal;
  * stdout.flush() in Python;
  * see documentation for other languages.



When you know the answer, you need to print it.

The format of the answer depends on whether the graph is bipartite or not.

If the graph is bipartite, print two lines. The first should contain the letter "Y" (short for "YES") followed by a space, and then a single integer s (0 ≤ s ≤ n) — the number of vertices in one of the partitions. Second line should contain s integers a_1, a_2, ..., a_s — vertices belonging to the first partition. All a_i must be distinct, and all edges in the main graph must have exactly one endpoint in the set \\{a_i\}.

If the graph is not bipartite, print two lines. The first should contain the letter "N" (short for "NO") followed by a space, and then a single integer l (3 ≤ l ≤ n) — the length of one simple cycle of odd length. Second line should contain l integers c_1, c_2, ..., c_l — the vertices along the cycle. It must hold that for all 1 ≤ i ≤ l, there is an edge \\{c_i, c_{(i mod l)+1}\} in the main graph, and all c_i are distinct.

If there are multiple possible answers, you may print any of them.

Hacks format For hacks, use the following format:

The first line contains two integers n and m~(1 ≤ n ≤ 600, 0 ≤ m ≤ (n(n-1))/(2)) — the number of vertices and edges of the graph, respectively.

Each of the next m lines contains two integers u_i and v_i~(1 ≤ u_i, v_i ≤ n) mean that there is an edge between u_i and v_i. There must not be any multiple edges, no loops, and the graph must be connected.

For example, you need to use this test to get the first sample:
    
    
      
    4 4  
    4 1  
    1 3  
    3 2  
    2 4  
    

Examples

Input

4
4
0
1
1
1
0

Output

? 4 
1 2 3 4
? 2
1 2
? 2
1 3
? 2
1 4
? 2
2 4
? 2
3 4
Y 2
1 2

Input

4
4
3

Output

? 4
1 4 2 3
? 3
1 2 4
N 3
2 1 4

Note

In the first case, Alice learns that there are 4 edges in the whole graph. Over the course of the next three queries, she learns that vertex 1 has two neighbors: 3 and 4. She then learns that while vertex 2 is adjacent to 4, the vertex 3 isn't adjacent to 4. There is only one option for the remaining edge, and that is (2, 3). This means that the graph is a cycle on four vertices, with (1, 2) being one partition and (3, 4) being the second. Here, it would be also valid to output "3 4" on the second line.

In the second case, we also have a graph on four vertices and four edges. In the second query, Alice learns that there are three edges among vertices (1, 2, 4). The only way this could possibly happen is that those form a triangle. As the triangle is not bipartite, Alice can report it as a proof. Notice that she does not learn where the fourth edge is, but she is able to answer Bob correctly anyway.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 6e2 + 50;
int N;
int query(vector<int>::iterator s, vector<int>::iterator e, int o = -1) {
  int sz = static_cast<int>(e - s) + (o >= 0);
  if (sz <= 1) return 0;
  printf("? %d\n", sz);
  if (o >= 0) printf("%d ", o);
  for (; s != e; s++) printf("%d ", *s);
  printf("\n");
  fflush(stdout);
  int ret;
  scanf("%d", &ret);
  if (ret == -1) exit(0);
  return ret;
}
int getE(int n, vector<int> arr) {
  int l = 0, r = arr.size();
  int a = query(arr.begin(), arr.end(), n) - query(arr.begin(), arr.end());
  if (a == 0) return -1;
  while (r > l + 1) {
    int m = (l + r) / 2;
    if (query(arr.begin() + l, arr.begin() + m, n) >
        query(arr.begin() + l, arr.begin() + m))
      r = m;
    else
      l = m;
  }
  return arr[l];
}
vector<int> adj[MAXN];
void build_tree() {
  vector<int> ind(N - 1, -1);
  for (int i = 0; i < N - 1; i++) ind[i] = i + 2;
  int o[MAXN], os = 0;
  o[os++] = 1;
  for (int i = 0, t; i < os; i++) {
    while ((t = getE(o[i], ind)) != -1) {
      adj[t].push_back(o[i]);
      adj[o[i]].push_back(t);
      o[os++] = t;
      for (int j = ind.size() - 1; j >= 0; j--)
        if (ind[j] == t) {
          ind.erase(ind.begin() + j);
          break;
        }
    }
  }
}
vector<int> P[2];
int c[MAXN];
void partition_dfs(int n = 1, int cl = 0, int p = -1) {
  c[n] = cl;
  P[cl].push_back(n);
  for (int i = 0; i < adj[n].size(); i++) {
    if (adj[n][i] == p) continue;
    partition_dfs(adj[n][i], cl ^ 1, n);
  }
}
int test_partitions() {
  for (int i = 0; i < 2; i++)
    if (query(P[i].begin(), P[i].end()) > 0) return i;
  return 2;
}
bool find_cycle_dfs(int n, vector<int>& ans, int g, int p = -1) {
  if (n == g) return true;
  for (int i = 0; i < adj[n].size(); i++) {
    if (adj[n][i] == p) continue;
    if (find_cycle_dfs(adj[n][i], ans, g, n)) {
      ans.push_back(n);
      return true;
    }
  }
  return false;
}
void find_cycle(int p, vector<int>& ans) {
  vector<int> nod(0, -1);
  int l = 0, h;
  for (h = 0; h < P[p].size(); nod.push_back(P[p][h++])) {
    if (query(nod.begin(), nod.end(), P[p][h])) break;
  }
  assert(h < P[p].size());
  int n = P[p][h];
  while (h > l + 1) {
    int m = (l + h) / 2;
    if (query(nod.begin() + l, nod.begin() + m, n))
      h = m;
    else
      l = m;
  }
  find_cycle_dfs(n, ans, nod[l]);
  ans.push_back(nod[l]);
}
int main() {
  scanf("%d", &N);
  int ctr = 2;
  build_tree();
  partition_dfs();
  int fp = test_partitions();
  if (fp == 2) {
    fp = 0;
    printf("Y %lu\n", P[fp].size());
    for (int i = 0; i < P[fp].size(); i++) printf("%d ", P[fp][i]);
    return 0;
  }
  vector<int> ans(0, -1);
  find_cycle(fp, ans);
  assert(ans.size() & 1);
  printf("N %lu\n", ans.size());
  for (int i = 0; i < ans.size(); i++) printf("%d ", ans[i]);
  printf("\n");
  return 0;
}