#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define pb push_back
#define fi first
#define se second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;



signed main(){

    int m, k; cin >> m >> k;
    mat a(k, vec(m)); cin >> a;

    vec S(k, 0), U(k, 0);
    REP(i, k) REP(j, m){
        S[i] += a[i][j];
        U[i] += a[i][j] * a[i][j];
    }

    int t0, x0, d0;
    if(S[0] + S[2] == 2 * S[1]){
        x0 = 0;
        int u = S[0], v = S[1] - S[0];
        FOR(i, 3, k) if(S[i] != u + v * i){
            t0 = i;
            d0 = S[i] - (u + v * i);
        }
    }else{
        x0 = 3;
        int v = S[4] - S[3], u = S[3] - v * 3;
        FOR(i, 0, 3) if(S[i] != u + v * i){
            t0 = i;
            d0 = S[i] - (u + v * i);
        }
    }
    
    //U=A+Bt+Ct^2
    int C = (U[x0] + U[x0 + 2] - 2 * U[x0 + 1]) / 2;
    int B = U[x0 + 1] - U[x0] - C * (2 * x0 + 1);
    int A = U[x0] - B * x0 - C * x0 * x0;

    REP(j, m){
        int U0 = U[t0] - a[t0][j] * a[t0][j] + (a[t0][j] - d0) * (a[t0][j] - d0);
        if(U0 == A + B * t0 + C * t0 * t0){
            cout << t0 << ' ' << a[t0][j] - d0 << endl;
            return 0;
        }
    }

    return 0;
}
