1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
#include <bits/stdc++.h>
#include "cielib.h"

using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define PII pair<int,int>
#define LD long double
#define FI first
#define SE second
#define st FI
#define nd SE
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())

template<class C> void mini(C&a4, C b4) { a4 = min(a4, b4); }
template<class C> void maxi(C&a4, C b4) { a4 = max(a4, b4); }

template<class TH> void _dbg(const char *sdbg, TH h){cerr<<sdbg<<"="<<h<<endl;}
template<class TH, class...TA> void _dbg(const char *sdbg, TH h, TA... a) {
  while (*sdbg!=',')cerr<<*sdbg++;cerr<<'='<<h<<",";_dbg(sdbg+1, a...);
}

template<class T> ostream& operator<<(ostream &os, vector<T> V) {
  os<<"[";for(auto vv:V)os<<vv<<","; os<<"]";
  return os;
}
template<class L, class R> ostream& operator<<(ostream &os, pair<L, R> P) {
  os<<"("<<P.first<<","<<P.second<<")";
  return os;
}

#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif

const int MaxDims = 505;

int dims, curSide;
int minDim[MaxDims], maxDim[MaxDims];
int query[MaxDims], queryOrig[MaxDims];


int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(12);
  cerr << fixed << setprecision(6);
  
  dims = podajD();
  curSide = podajR() + 1;

  for (int i = 0; i < dims; i++) {
    maxDim[i] = curSide - 1;
  }

  while (curSide > 3) {
    int nxtSide = curSide / 2 + 1;

    for (int i = 0; i < dims; i++) {
      query[i] = queryOrig[i] = (minDim[i] + maxDim[i]) / 2;
    }

    for (int i = 0; i < dims; i++) {
      query[i] = minDim[i];
      czyCieplo(query);

      query[i] = maxDim[i];
      if (czyCieplo(query)) {
        minDim[i] = maxDim[i] - nxtSide + 1;
      } else {
        maxDim[i] = minDim[i] + nxtSide - 1;
      }

      query[i] = queryOrig[i];
    }

    curSide = nxtSide;

#ifdef LOCAL
    for (int i = 0; i < dims; i++) {
      debug(i, minDim[i], maxDim[i]);
    }
#endif
  }

#ifdef LOCAL
  for (int i = 0; i < dims; i++) {
    debug(i, minDim[i], maxDim[i]);
  }
#endif

  for (int i = 0; i < dims; i++) {
    query[i] = (minDim[i] + maxDim[i]) / 2;
  }

  for (int i = 0; i < dims; i++) {
    query[i]--;
    czyCieplo(query);
    query[i]++;
    bool isGeq = czyCieplo(query);

    query[i]++;
    czyCieplo(query);
    query[i]--;
    bool isLeq = czyCieplo(query);

    if (isGeq && !isLeq) {
      minDim[i] = maxDim[i];
    } else if (!isGeq && isLeq) {
      maxDim[i] = minDim[i];
    } else {
      minDim[i] = maxDim[i] = query[i];
    }
  }

  znalazlem(minDim);
}