#ifdef LOCAL
#include "stdafx.h"
#else
#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define sz(v) ((int) (v).size())
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)
using namespace std;

using vi = vector<int>;
#endif

constexpr int inf = 1e8;
constexpr int dx[] = {0, 0, 1, -1};
constexpr int dy[] = {1, -1, 0, 0};

using pi = pair<int, int>;
using vp = vector<pi>;
#define fi first
#define se second

int k;

IL int dis (pi x, pi y) {
  return abs(x.fi - y.fi) + abs(x.se - y.se);
}

vi query (vp probes) {
  printf("?");
  for (auto [x, y] : probes) {
    printf(" %d %d", x, y);
  }
  printf("\n");
  fflush(stdout);

  vi d(sz(probes) * k);
  L (i, 0, sz(d) - 1) {
    scanf("%d", &d[i]);
  }
  return d;
}

constexpr int N = 1e6 + 9;
constexpr int M = 1e3 + 9;
pi ch[M], pts[M];
vi lis[M];

bool conf[M], used[N], vis[N];

vp solve (int b, int k, int w) {
  vi st = query({{-b, b}, {-b, -b}});
  set<pi> init;
  for (int p : st) {
    for (int q : st) {
      if ((p + q) % 2) {
        continue;
      }
      int x = (p + q - 2 * b) / 2 - b;
      int y = p - (b + x) - b;
      if (x < -b || x > b || y < -b || y > b) {
        continue;
      }
      init.emplace(x, y);
    }
  }
  vp dots(init.begin(), init.end());
  int n = sz(dots);
	vp ch, pts;
	vector<vi> lis;
  vector<bool> conf(n, false);
	int lim = 4 * n * n;
  vector<bool> used(lim + 1, false);
  vector<bool> vis(lim + 1, false);
  L (d, 0, lim) {
    if (sz(ch) == n) {
      break;
    }
    if (vis[d]) {
      continue;
    }
    L (i, 0, n - 1) {
      if (conf[i]) {
        continue;
      }
      pi dot;
      L (o, 0, 3) {
				int x = dots[i].fi + dx[o] * d;
				int y = dots[i].se + dy[o] * d;
				if (x < -inf || x > inf || y < -inf || y > inf) {
					continue;
				}
				bool fail = false;
				L (j, 0, n - 1) {
					if (i == j) {
						continue;
					}
					int z = dis({x, y}, dots[j]);
					if ((!conf[j] && z == d) || (z <= lim && used[z])) {
						fail = true;
						break;
					}
				}
				if (fail) {
					continue;
				}
				dot = {x, y};
				goto found;
      }
      continue;
      found: 
				vi cur;
				L (j, 0, n - 1) {
					int z = dis(dot, dots[j]);
					if (z <= lim) {
						if (z == d) {
							cur.eb(j);
						}
						vis[z] = true;
					}
				}
        ch.eb(i, d);
        pts.eb(dot);
				lis.eb(cur);
        conf[i] = true;
				used[d] = true;
        break;
    }
  }
  assert(sz(ch) == n);
  vi ds = query(pts);
  multiset<int> s(ds.begin(), ds.end());
	conf.assign(n, false);
  vp ns;
  L (i, 0, n - 1) {
		int cnt = 1;
		for (int x : lis[i]) {
			cnt ++;
		}
    if (s.count(ch[i].se) == cnt) {
      int id = ch[i].fi;
      ns.eb(dots[id]);
			conf[id] = true;
    }
  }
  assert(sz(ns) == k);
	return ns;
}

int main () {
  int b, w;
  scanf("%d%d%d", &b, &k, &w);
  vp ns = solve(b, k, w);
  printf("!");
  L (i, 0, k - 1) {
    printf(" %d %d", ns[i].fi, ns[i].se);
  }
  printf("\n");
  fflush(stdout);
}
// I love WHQ!