#include <bits/stdc++.h>
using namespace std;

#define int long long

int n,m,s,a,b,x,y;

int gcd(int x,int y){
	return x?gcd(y%x,x):y;
}

int exgcd(int a,int b,int &x,int &y){
	if(!b) return x=1,y=0,a;
	int g;return g=exgcd(b,a%b,y,x),y-=a/b*x,g;
}

auto solve(int a,int b,int c){
	int x,y,g;
	g=exgcd(a,b,x,y);
	if(c%g) return pair<int,int>{-1,-1};
	x*=c/g;
	x=(x%b+b)%b;
	y=(c-a*x)/b;
	// cerr<<a<<" "<<b<<" "<<c<<" "<<x<<" "<<y<<endl;
	return pair<int,int>{x,y};
}

signed main(){
	ios::sync_with_stdio(0);
	cin>>n>>m;
	for(int i=1,x;i<=n;i++) cin>>x,s=(s+x)%m;
	int A=n,B=n*(n+1)/2;
	int g=gcd(A,B);
	for(int i=0;i<n;i++){
		pair<int,int> a=solve(g,m,i-s);
		if(a.first==-1) continue;
		pair<int,int> b=solve(A,B,(a.first+m*n)*g);
		cout<<i<<endl<<b.first%m<<" "<<b.second%m<<endl;
		break;
	}
}