#include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define __builtin_ctz __builtin_ctzll
#define __builtin_clz __builtin_clzll
#define __builtin_popcount __builtin_popcountll
using namespace std;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t) {
  while(*sdbg != ',') { cerr<<*sdbg++; } cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define cerr if(0)cout
#endif
#define next ____next
#define prev ____prev
#define left ____left
#define hash ____hash
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

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 T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
  bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
template<class T> void ResizeVec(T&, vector<int>) {}
template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
  vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
  for (T& v : vec) { ResizeVec(v, sz); }
}
typedef Triple<int, int, int> TIII;
template<class A, class B, class C>
ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }
template<class T> ostream& operator<<(ostream& out, vector<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class T> ostream& operator<<(ostream& out, set<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class L, class R> ostream& operator<<(ostream& out, map<L, R> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }

int Sq(int x) {
  return x * x;
}

int32_t main() {

  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  cerr << fixed << setprecision(10);
  cin.tie(0);
  //double beg_clock = 1.0 * clock() / CLOCKS_PER_SEC;
  
  int m, k;
  cin>>m>>k;
  VVI poses;
  VI sums;
  RE (i, k) {
    VI here;
    sums.PB(0);
    RE (j, m) {
      int a;
      cin>>a;
      sums.back() += a;
      here.PB(a);
    }
    poses.PB(here);
  }
  int d1 = sums[1] - sums[0];
  int wrong = 0;
  int wh = -1;
  int diff = 0;
  REP (i, k) {
    if (sums[i] != sums[0] + i * d1) {
      wrong++;
      wh = i;
      diff = sums[i] - (sums[0] + i * d1);
    }
  }
  if (wrong != 1) {
    d1 = sums[k - 1] - sums[k - 2];
    wrong = 0;
    REP (i, k) {
      if (sums[i] != sums[k - 1] - (k - 1 - i) * d1) {
        wrong++;
        wh = i;
        diff = sums[i] - (sums[k - 1] - (k - 1 - i) * d1);
      }
    }
    assert(wrong == 1);
  }
  VPII pts;
  REP (i, k) {
    if (i == wh) { continue; }
    int sq = 0;
    REP (j, m) {
      REP (l, j) {
        sq += Sq(poses[i][j] - poses[i][l]);
      }
    }
    pts.PB({i, sq});
    if (SZ(pts) == 3) { break; }
  }
  debug(pts);
  LD need_sq = 0;
  REP (i, 3) {
    LD prod = 1;
    REP (j, 3) {
      if (i == j) { continue; }
      prod *= (wh - pts[j].st);
      prod /= (pts[i].st - pts[j].st);
    }
    prod *= pts[i].nd;
    need_sq += prod;
  }
  debug(need_sq);
  debug(diff);
  int A = (int)round(need_sq);
#ifdef LOCAL
  assert(abs(A - need_sq) < 0.01);
#endif
  int sq_wrong = 0;
  REP (i, m) {
    REP (j, i) {
      sq_wrong += Sq(poses[wh][i] - poses[wh][j]);
    }
  }
  REP (i, m) {
    int cp = sq_wrong;
    REP (j, m) {
      sq_wrong -= Sq(poses[wh][i] - poses[wh][j]);
    }
    poses[wh][i] -= diff;
    REP (j, m) {
      sq_wrong += Sq(poses[wh][i] - poses[wh][j]);
    }
    poses[wh][i] += diff;
    if (sq_wrong == A) {
      cout<<wh<<" "<<poses[wh][i] - diff<<endl;
      return 0;
    }
    sq_wrong = cp;
  }
  assert(false);
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  return 0;
}
