Problem: Cirno gives AquaMoon a problem. There are m people numbered from 0 to m - 1. They are standing on a coordinate axis in points with positive integer coordinates. They are facing right (i.e. in the direction of the coordinate increase). At this moment everyone will start running with the constant speed in the direction of coordinate increasing. The initial coordinate of the i-th person on the line is x_i, and the speed of the i-th person is v_i. So the coordinate of the i-th person at the moment t will be x_i + t ⋅ v_i.

Cirno captured the coordinates of m people in k consecutive integer moments from 0 to k - 1. In every moment, the coordinates of m people were recorded in arbitrary order.

To make the problem more funny, Cirno modified one coordinate at the moment y (0 < y < k-1) to a different integer.

AquaMoon wants to find the moment y and the original coordinate p before the modification. Actually, she is not a programmer at all. So she wasn't able to solve it. Can you help her?

Input

This problem is made as interactive. It means, that your solution will read the input, given by the interactor. But the interactor will give you the full input at the beginning and after that, you should print the answer. So you should solve the problem, like as you solve the usual, non-interactive problem because you won't have any interaction process. The only thing you should not forget is to flush the output buffer, after printing the answer. Otherwise, you can get an "Idleness limit exceeded" verdict. Refer to the [interactive problems guide](https://codeforces.com/blog/entry/45307) for the detailed information about flushing the output buffer.

The first line contains two integers m and k (5 ≤ m ≤ 1000, 7 ≤ k ≤ 1000) — the number of people and the number of recorded moments. 

The next k lines contain captured positions. i-th of these lines contains m integers between 1 and 10^6 (inclusive), representing positions captured by Cirno at the moment i-1.

The input is guaranteed to be valid (i.e. only one integer was modified to a different value according to the problem statement). Also, it is guaranteed, that 1 ≤ v_i ≤ 1000 for all 1 ≤ i ≤ m.

Hack format:

The first line should contain two integers m and k (5 ≤ m ≤ 1000, 7 ≤ k ≤ 1000) — the number of people and the number of moments. 

In the second line, there should be m integers x_0, x_1, ...,x_{m - 1} (1 ≤ x_i ≤ 10^6), where x_i is the initial coordinate of the i-th person.

In the third line, there should be m integers v_0, v_1, ...,v_{m - 1} (1 ≤ v_i ≤ 1000), where v_i is the speed of the i-th person. It should be true that x_i + (k-1) v_i ≤ 10^6 for each 0 ≤ i < m.

In the next k lines, each line should contain m integers. i-th line should contain m distinct integers p_0, p_1, …, p_{m-1} (0 ≤ p_j < m). The meaning of these numbers: j-th integer in the input in the i-th moment is the coordinate of the p_{j}-th person.

In the last line, there should be three integers y, i, c. Cirno modified the coordinate of the i-th person at the moment y to c (1 ≤ y ≤ k-2, 0 ≤ i ≤ m - 1, 1 ≤ c ≤ 10^6, c ≠ x_i + y ⋅ v_i).

Output

Print a single line with two integers y, p — the moment that contains the modified coordinate and the original coordinate.

Example

Input


5 7
6 9 9 6 9
10 7 10 8 10
11 11 11 10 8
12 12 12 12 9
14 13 12 10 13
11 14 16 14 14
12 15 18 15 15


Output


4 13

Note

In the first test the initial coordinates of people are 9, 6, 6, 9, 9 and their speeds are 1, 2, 1, 1, 1. So, it's easy to see, that at the moment 4 one coordinate was modified from 13 to 12.

This is the first test in the hack format:
    
    
      
    5 7  
    9 6 6 9 9  
    1 2 1 1 1  
    2 3 4 1 0  
    0 2 3 1 4  
    4 3 0 1 2  
    1 3 4 0 2  
    1 4 0 2 3  
    2 4 1 3 0  
    2 4 1 3 0  
    4 0 12  
    

Solution (in CPP):

Solution:
#include <algorithm>  
#include <iostream>  
#include <sstream>  
#include <string>  
#include <vector>  
#include <queue>  
#include <set>  
#include <map>  
#include <cstdio>  
#include <cstdlib>  
#include <cctype>  
#include <cmath>  
#include <cstring>
#include <list>  
#include <cassert>
#include <climits>
#include <bitset>
#include <chrono>
#include <random>
using namespace std;

#define PB push_back  
#define MP make_pair  
#define SZ(v) ((int)(v).size())  
#define FOR(i,a,b) for(int i=(a);i<(b);++i)  
#define REP(i,n) FOR(i,0,n)  
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)  
#define REPE(i,n) FORE(i,0,n)  
#define FORSZ(i,a,v) FOR(i,a,SZ(v))  
#define REPSZ(i,v) REP(i,SZ(v))  
std::mt19937 rnd((int)std::chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }

const int MAXP = 1000; // MINP=5
const int MAXT = 1000; // MINT=7

int np, nt;
int pos[MAXT][MAXP];
int anst, anspos;

ll sumpos[MAXT];
ll sumsq[MAXT];
bool tok[MAXT];

void solve() {
	REP(i, nt) { sumpos[i] = 0; REP(j, np) sumpos[i] += pos[i][j]; }
	REP(i, nt) { sumsq[i] = 0; REP(j, np) sumsq[i] += (ll)pos[i][j] * pos[i][j]; }
	map<ll, int> diffcnt; REP(i, nt - 1) diffcnt[sumpos[i + 1] - sumpos[i]]++;
	ll sumv = -1; int mxdiffcnt = -1; for (auto z : diffcnt) if (z.second > mxdiffcnt) mxdiffcnt = z.second, sumv = z.first;
	//printf("sumv=%lld\n", sumv);
	
	REP(i, nt) tok[i] = false;
	REP(i, nt - 1) if (sumpos[i + 1] - sumpos[i] == sumv) tok[i] = tok[i + 1] = true;
	//printf("tok: "); REP(i, nt) printf("%c", tok[i] ? 'V' : 'x'); puts("");

	int st = 0;
	while (st <= nt - 3 && (!tok[st] || !tok[st + 1] || !tok[st + 2])) ++st;
	assert(st <= nt - 3);
	ll a = sumsq[st], b = sumsq[st + 1], c = sumsq[st + 2];
	// a=sum((xj+st*vj)^2)=sum(xj^2+2*st*xj*vj+st^2*vj^2)
	// b=sum((xj+(st+1)*vj)^2)=sum(xj^2+2*(st+1)*xj*vj+(st+1)^2*vj^2)
	// c=sum((xj+(st+2)*vj)^2)=sum(xj^2+2*(st+2)*xj*vj+(st+2)^2*vj^2)
	// b-a=sum(2*xj*vj+(2*st+1)*vj^2)
	// c-b=sum(2*xj*vj+(2*st+3)*vj^2)
	// (c-b)-(b-a)=sum(2*vj^2)
	ll sumvv = (c - b) - (b - a); assert(sumvv % 2 == 0); sumvv /= 2;
	//printf("sumvv=%lld\n", sumvv);
	// b-a-(2*st+1)*sumvv=sum(2*xj*vj)
	ll sumxv = (b - a) - (2 * st + 1) * sumvv; assert(sumxv % 2 == 0); sumxv /= 2;
	//printf("sumxv=%lld\n", sumxv);
	// sumpos[st]=sum(xj+st*vj)
	ll sumx = sumpos[st] - st * sumv;
	//printf("sumx=%lld\n", sumx);
	ll sumxx = a - 2 * st * sumxv - (ll)st * st * sumvv;
	//printf("sumxx=%lld\n", sumxx);
	REP(i, nt) if (sumpos[i] != sumx + i * sumv) {
		ll delta = sumpos[i] - (sumx + i * sumv);
		assert(delta != 0);
		anst = i;
		//printf("delta=%lld\n", delta);
		//sum((xj + i * vj) ^ 2)-(xk+i*vk)^2+(xk+i*vk+delta)^2=sumxx+2*i*sumxv+i*i*sumvv+delta*delta+2*delta*(xk+i*vk)
		ll ans = sumsq[i] - sumxx - 2 * i * sumxv - (ll)i * i * sumvv - delta * delta; assert(ans % (2 * delta) == 0); ans /= 2 * delta;
		anspos = ans;
		return;
	}
	assert(false);
}

void run() {
	scanf("%d%d", &np, &nt);
	REP(i, nt) REP(j, np) scanf("%d", &pos[i][j]);
	solve();
	printf("%d %d\n", anst, anspos);
}

int main() {
	run();
	return 0;
}