Problem: Pay attention: this problem is interactive.

Penguin Xoriy came up with a new game recently. He has n icicles numbered from 1 to n. Each icicle has a temperature — an integer from 1 to 109. Exactly two of these icicles are special: their temperature is y, while a temperature of all the others is x ≠ y. You have to find those special icicles. You can choose a non-empty subset of icicles and ask the penguin what is the bitwise exclusive OR (XOR) of the temperatures of the icicles in this subset. Note that you can't ask more than 19 questions.

You are to find the special icicles.

Input

The first line contains three integers n, x, y (2 ≤ n ≤ 1000, 1 ≤ x, y ≤ 109, x ≠ y) — the number of icicles, the temperature of non-special icicles and the temperature of the special icicles.

Output

To give your answer to the penguin you have to print character "!" (without quotes), then print two integers p1, p2 (p1 < p2) — the indexes of the special icicles in ascending order. Note that "!" and p1 should be separated by a space; the indexes should be separated by a space too. After you gave the answer your program should terminate immediately.

Interaction

To ask a question print character "?" (without quotes), an integer c (1 ≤ c ≤ n), and c distinct integers p1, p2, ..., pc (1 ≤ pi ≤ n) — the indexes of icicles that you want to know about. Note that "?" and c should be separated by a space; the indexes should be separated by a space too.

After you asked the question, read a single integer — the answer.

Note that you can't ask more than 19 questions. If you ask more than 19 questions or at least one incorrect question, your solution will get "Wrong answer".

If at some moment your program reads  - 1 as an answer, it should immediately exit (for example, by calling exit(0)). You will get "Wrong answer" in this case, it means that you asked more than 19 questions, or asked an invalid question. If you ignore this, you can get other verdicts since your program will continue to read from a closed stream.

Your solution will get "Idleness Limit Exceeded", if you don't print anything or forget to flush the output, including for the final answer .

To flush you can use (just after printing): 

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



Hacking

For hacking use the following format:

n x y p1 p2

Here 1 ≤ p1 < p2 ≤ n are the indexes of the special icicles.

Contestant programs will not be able to see this input.

Example

Input

4 2 1
2
1
1<span class="tex-font-style-it"></span>

Output

? 3 1 2 3
? 1 1
? 1 3
! 1 3

Note

The answer for the first question is <image>.

The answer for the second and the third questions is 1, therefore, special icicles are indexes 1 and 3.

You can read more about bitwise XOR operation here: <https://en.wikipedia.org/wiki/Bitwise_operation#XOR>.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 1003;
pair<int, int> tree[4 * N];
vector<int> qu, res;
int x, y, ans;
int srch() {
  int l = 0, r = qu.size() - 1;
  while (l < r) {
    int mid = (l + r) >> 1;
    printf("? %d ", mid - l + 1);
    for (int i = l; i <= mid; i++) {
      printf("%d ", qu[i]);
    }
    printf("\n");
    fflush(stdout);
    scanf("%d", &ans);
    if (ans == -1) {
      exit(0);
    }
    if (ans != x && ans != 0) {
      r = mid;
    } else {
      l = mid + 1;
    }
  }
  return qu[l];
}
int main() {
  int n;
  scanf("%d %d %d", &n, &x, &y);
  queue<pair<int, int> > Q;
  int l = 1, r = n, cnt = 0, depth = 1, sum = 0;
  int mid = l + ((r - l) >> 1);
  Q.push({l, mid});
  Q.push({mid + 1, r});
  while (!Q.empty()) {
    pair<int, int> t = Q.front();
    Q.pop();
    cnt++;
    tree[cnt] = t;
    l = t.first;
    r = t.second;
    if (cnt & 1) {
      for (int i = l; i <= r; i++) {
        qu.push_back(i);
      }
    }
    if (cnt == sum + (1 << depth)) {
      int sz = qu.size();
      printf("? %d ", sz);
      for (int i = 0; i < sz; i++) {
        printf("%d ", qu[i]);
      }
      printf("\n");
      fflush(stdout);
      scanf("%d", &ans);
      if (ans == -1) {
        return 0;
      }
      if (ans != x && ans != 0) {
        res.push_back(srch());
        qu.clear();
        for (int i = sum + 1;; i++) {
          if (tree[i].first <= res[0] && res[0] <= tree[i].second) {
            for (int j = tree[i + 1].first; j <= tree[i + 1].second; j++) {
              qu.push_back(j);
            }
            res.push_back(srch());
            goto print;
          }
        }
      }
      qu.clear();
      sum = cnt;
      depth++;
    }
    mid = l + ((r - l) >> 1);
    Q.push({l, mid});
    Q.push({mid + 1, r});
  }
print:
  printf("! %d %d", res[0], res[1]);
  return 0;
}