#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, k, g;
    cin >> n >> k >> g;

#ifdef __APPLE__
    int s;
    cin >> s;
    vector<int> arr(n, 5);
    fill(arr.begin() + s - 1, arr.begin() + s - 1 + k, 4);
#endif

    auto ask = [&](vector<int> a, vector<int> b) {
        cout << "? " << a.size() << " " << b.size() << " ";
        for (int x : a) {
            cout << x << " ";
        }
        for (int x : b) {
            cout << x << " ";
        }
        cout << endl;
#ifdef __APPLE__
        int sa = 0, sb = 0;
        for (int x : a) {
            sa += arr[x - 1];
        }
        for (int x : b) {
            sb += arr[x - 1];
        }
        return (sa > sb ? 1 : sb > sa ? 2 : 0);
#endif
        int res;
        cin >> res;
        if (res == -1) {
            exit(0);
        }
        return res;
    };


    vector<int> a;
    for (int i = 1; i <= n; i += k) {
        a.push_back(i);
    }
    while (a.size() > 1) {
        int x = (a.size() + 1) / 3;
        int middle = a.size() - x * 2;
        vector<int> l(a.begin(), a.begin() + x), m(a.begin() + x, a.begin() + x + middle), r(a.begin() + x + middle, a.end());
        int res = ask(l, r);
        if (res == 0) {
            a = m;
        } else if (res == 1) {
            a = r;
        } else {
            a = l;
        }
    }

    int c = a[0];
    int any = c - k >= 1 ? c - k : c + k;
    int l = max(1, c - k + 1);
    int r = min(c, n - k + 1);
    a.clear();
    for (int i = l; i <= r; ++i) {
        a.push_back(i);
    }
    while (a.size() > 2) {
        int x = a.size() / 3;
        int middle = a.size() - x * 2;
        int lx = a[x - 1];
        int rx = a[x + middle - 1];
        assert(rx + k <= n);
        int res = ask({lx}, {rx + k});
        if (res == 0) {
            a = vector(a.begin() + x, a.begin() + x + middle);
        } else if (res == 1) {
            a = vector(a.begin() + x + middle, a.end());
        } else {
            a = vector(a.begin(), a.begin() + x);
        }
    }
    int ans = -1;
    if (a.size() == 2) {
        if (ask({a[0]}, {any}) == 2) {
            ans = a[0];
        } else {
            ans = a[1];
        }
    } else {
        ans = a[0];
    }
    cout << "! " << ans << '\n';


    return 0;
}