#include "books.h"
#include <cstdio>
#include <vector>
#include <algorithm>
#include <vector>
#define ll long long
#define _pb push_back
#define MAX_N 104312

using namespace std;

ll read(){ll x = 0;char c = 0, v = 0;do{c = getchar();if(c == '-')v = 1;} while(c < '0' || c > '9');do{x = (x << 3) + (x << 1) + c - '0';c = getchar();} while(c >= '0' && c <= '9');return v ? -x : x;}

/*long long skim(int i)
{
    printf("? %d\n", i);
    fflush(stdout);
    return read();
}

void answer(vector<int> v)
{
    printf("! ");
    for(auto p: v)
        printf("%d ", p);
    printf("\n");
    fflush(stdout);
}

void impossible()
{
    printf("! -1\n");
    fflush(stdout);
}*/

ll a[MAX_N];

ll query(int i)
{
    if(a[i])
        return a[i];
    return a[i] = skim(i);
}

int n, k;
ll c;
vector<int> vec;

void solve(int N, int K, long long A, int S)
{
    n = N, k = K, c = A;
    ll sumn = 0;
    for(int i = 1; i <= k; i++)
        sumn += query(i);
    ll sumnk = sumn - a[k];
    if(sumn > 2 * c)
    {
        impossible();
        return;
    }
    if(n == k)
    {
        if(sumn < c)
            impossible();
        else
        {
            for(int i = 1; i <= k; i++)
                vec._pb(i);
            answer(vec);
        }
        return;
    }
    int l = k + 1, r = n;
    while(l < r)
    {
        int mid = (l + r + 1) >> 1;
        if(query(mid) + sumnk > 2 * c)
            r = mid - 1;
        else
            l = mid;
    }
    n = l;
    ll sumx = 0;
    for(int i = n; i >= n - k + 1; i--)
        sumx += query(i);
    if(sumx < c)
    {
        impossible();
        return;
    }
    ll sum = sumx;
    for(int i = 1; i <= k + 1; i++)
    {
        if(sum >= c && sum <= 2 * c)
        {
            for(int j = 1; j < i; j++)
                vec._pb(j);
            for(int j = n - k + i; j <= n; j++)
                vec._pb(j);
            answer(vec);
            return;
        }
        if(i != k + 1)
            sum -= a[n - k + i] - a[i];
    }
    impossible();
}

/*int main()
{
    int n = read();
    int k = read();
    int a = read();
    solve(n, k, a, 40);
    return 0;
}*/