CodeForces 763C. Timofey and remoduling

Little Timofey likes integers a lot. Unfortunately, he is very young and can't work with very big integers, so he does all the operations modulo his favorite prime m. Also, Timofey likes to look for arithmetical progressions everywhere.

One of his birthday presents was a sequence of distinct integers a1, a2, ..., an. Timofey wants to know whether he can rearrange the elements of the sequence so that is will be an arithmetical progression modulo m, or not.

Arithmetical progression modulo m of length n with first element x and difference d is sequence of integersx, x + d, x + 2d, ..., x + (n - 1)·d, each taken modulo m.

Input

The first line contains two integers m and n (2 ≤ m ≤ 109 + 7, 1 ≤ n ≤ 105, m is prime) — Timofey's favorite prime module and the length of the sequence.

The second line contains n distinct integers a1, a2, ..., an (0 ≤ ai < m) — the elements of the sequence.

Output

Print -1 if it is not possible to rearrange the elements of the sequence so that is will be an arithmetical progression modulo m.

Otherwise, print two integers — the first element of the obtained progression x (0 ≤ x < m) and its difference d (0 ≤ d < m).

If there are multiple answers, print any of them.

Examples

input

17 5
0 2 4 13 15

output

13 2

input

17 5
0 2 4 13 14

output

-1

input

5 3
1 2 3

output

3 4

题意：给定n,m和序列a，构造一个等差数列，使得它所有元素%m之后重排能够变成a，输出首项和公差

题解：智商题，不考算法，考脑洞

先考虑2*n<=m的情况

考虑a中的两个元素之差，假设它们在最后序列的位置为i,i+k，那么它们之差为k*d%m

由于保证2*n<=m所以这样的差只会出现n-k次，nlogn统计这个差出现的次数，于是我们就求出了k，从而求出了d，然后check即可

如果2*n>m

之前提到的差不会只出现n-k次，因为可能经过多遍，

那么把m内a的补集做一次，然后首项加上公差*项数即可（保证m是质数）

据说这题m不是质数也能做，有没有神犇教我一下啊QAQ

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 100010;

int ans = -1, ansd, a[MAXN], b[MAXN], n, m;

inline int Pow(int x, int y, int mod)
{
	int s = 1;
	for( ; y ; y >>= 1, x = 1ll * x * x % mod ) if( y & 1 ) s = 1ll * s * x % mod;
	return s;	
}

inline bool find(int *a, int n, int x) { int t = lower_bound( a + 1, a + n + 1, x ) - a; return a[ t ] == x; }

inline void solve(int *a, int n)
{
	if( n == 1 ) { ans = a[ 1 ], ansd = 1; return ; } 
	int tmp = a[ 2 ] - a[ 1 ], cnt = 0;
	for( int i = 1 ; i <= n ; i++ ) if( find( a, n, ( a[ i ] + tmp ) % m ) ) cnt++;
	ansd = 1ll * tmp * Pow( n - cnt , m - 2, m ) % m;
	int d = ( m - ansd ) % m;
	for( int i = 1 ; i <= n ; i++ ) if( !find( a, n, ( a[ i ] + d ) % m ) )
	{
		if( ans == -1 ) ans = a[ i ];
		else { ans = -1; return ; }
	}
}

int main()
{
	scanf( "%d%d", &m, &n );
	for( int i = 1 ; i <= n ; i++ ) scanf( "%d", &a[ i ] );
	sort( a + 1, a + n + 1 );
	if( n == 1 || n == m ) return printf( "%d 1\n", a[ 1 ], 1 ), 0;
	if( 2 * n < m ) solve( a, n );
	else
	{
		int t = 0;
		for( int i = 0 ; i < m ; i++ ) if( !find( a, n, i ) ) b[ ++t ] = i;
		solve( b, t );
		if( ans != -1 ) ( ans += 1ll * ansd * t % m ) %= m;
	}
	if( ans == -1 ) return printf( "-1\n" ), 0;
	return printf( "%d %d\n", ans, ansd ), 0;
}