#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MP make_pair
mt19937 rnd(time(0));
int n,m;ll s;
ll gcd(ll a,ll b){
	if(a+b==0) return m;
	else if(!a||!b) return a?a:b;
	return gcd(b,a%b); 
} 
void construct(ll x,ll y,ll p){
	ll g=gcd(x,y);
	x/=g,y/=g,p/=g;
	map<ll,ll> mp;
	for(int i=1;i<=1e6;i++){
		ll k=rnd()%m;
		mp[k*x%m]=k;
	}
	while(1){
		ll k=rnd()%m;
		if(mp.count((p-y*k%m+m)%m)){
			cout<<mp[(p-y*k%m+m)%m]<<' '<<k<<endl;
			return;
		}
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin>>n>>m;
	for(int i=1,a;i<=n;i++){
		cin>>a;s+=a;
	}
	ll a=1ll*n*(n+1)/2%m,b=n%m;s%=m;
	ll g=gcd(gcd(a,b),(ll)m);
	cout<<s%g<<endl;
	construct(b,a,(m+s%g-s)%m);
	return 0;
}