#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <cassert>
#include <queue>
#include <set>
#include <map>
#include <valarray>
#include <bitset>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1<<29;
const double EPS = 1e-8;
const double PI = acos(-1);

typedef long long ll;
typedef pair<int,int> pii;

typedef complex<double> P;
namespace std {
bool operator < (const P& a, const P& b) {
  // if (abs(a-b)<EPS) return 0;
  return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);
}
}
double cross(const P& a, const P& b) {
  return imag(conj(a)*b);
}
double dot(const P& a, const P& b) {
  return real(conj(a)*b);
}
struct L : public vector<P> {
  L(const P &a, const P &b) {
    push_back(a); push_back(b);
  }
  L() {}
};
typedef vector<P> G;
#define curr(P, i) P[i]
#define next(P, i) P[(i+1)%P.size()]
struct C {
  P p; double r;
  C(const P &p, double r) : p(p), r(r) { }
};

int ccw(P a, P b, P c) {
  b -= a; c -= a;
  if (cross(b, c) > 0)   return +1;       // counter clockwise
  if (cross(b, c) < 0)   return -1;       // clockwise
  if (dot(b, c) < 0)     return +2;       // c--a--b on line
  if (norm(b) < norm(c)) return -2;       // a--b--c on line
  return 0;
}

P crosspoint(const L &l, const L &m) {
  double A = cross(l[1] - l[0], m[1] - m[0]);
  double B = cross(l[1] - l[0], l[1] - m[0]);
  if (abs(A) < EPS && abs(B) < EPS) return m[0]; // same line
  if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!
  return m[0] + B / A * (m[1] - m[0]);
}

G convex_cut(const G& g, const L& l) {
  G Q;
  REP(i, g.size()) {
    P A = curr(g, i), B = next(g, i);
    if (ccw(l[0], l[1], A) != -1) Q.push_back(A);
    if (ccw(l[0], l[1], A)*ccw(l[0], l[1], B) < 0)
      Q.push_back(crosspoint(L(A, B), l));
  }
  return Q;
}
double angle(const P &a, const P &b) {        // ベクトルａからみたベクトルｂの角度の計算[0,2pi)
  double ret = arg(b)-arg(a);
  return (ret>=0) ? ret : ret + 2*PI;
}
double angle2(const P &a, const P &b) { // ベクトルaとベクトルbの間の角度
  return min(angle(a,b), angle(b,a));
}

double area(const G& g) {
  double A = 0;
  for (int i = 0; i < g.size(); ++i) {
    A += cross(g[i], next(g, i));
  }
  return A/2;
}

int main() {
  double w, h, e;
  cin >> w >> h >> e;
  e = e*PI/180;
  G poly;
  poly.push_back(P(-w,h));
  poly.push_back(P(-w,-h));
  poly.push_back(P(w,-h));
  poly.push_back(P(w,h));
  int cnt = 0;
  while(cnt<200) {
    P g;
    FOR(it, poly) {
      g += *it;
    }
    g /= (int)poly.size();
    vector<P> v;
    P p1, p2;
    int a = 0;
    while(1) {
      printf("? %.12f %.12f\n", g.real(), g.imag()); fflush(stdout);
      //cerr << a++ << endl;
      if (++cnt == 200) break;
      double deg = 1;
      scanf("%lf", &deg);
      deg = deg * PI / 180;
      P p(cos(deg),sin(deg));
      bool f = 0;
      FOR(it, v) {
        double a = angle2(*it,p)*180/PI;
        //cout << a << endl;
        if (a < 120 && a >= e*180/PI-60) {
          p1 = p;
          p2 = *it;
          f = 1;
          break;
        }
      }
      if (f) break;
      v.push_back(p);
    };
    //if (cnt == 2) break;
    if (cnt == 200) break;
    if (angle(p1,p2) > angle(p2,p1)) swap(p1,p2);
    L l(g,g + (p1+p2) * P(0,-1));
    //cerr << l[0] << " " << l[1] << " - " << (g + (p1+p2)) << endl;
    G tmp = convex_cut(poly, l);
    //cerr << "; "; FOR(it, poly) cerr << *it << " ";cerr << endl;
    //assert(tmp.size());
    if (tmp.size() == 0) break;
    poly = tmp;
  }
  P g;
  FOR(it, poly) {
    g += *it;
  }
  g /= (int)poly.size();

  printf("! %.12f %.12f\n", g.real(), g.imag()); fflush(stdout);
}

Measured memory_bytes: 0