#include<bits/stdc++.h>
using namespace std;
#define int long long    
#define vi vector<int>
#define vii vector<vi>
#define pb push_back
#define pir pair<int,int>
const int P = 1e9 + 7;
const int N = 1e6+7;
const int inf = 0x3f3f3f3f3f3f3f3f;//longlong
const int ing = 1e18;
//const int mod = 998244353;
//cout << fixed << setprecision(5) << number << endl;
//tuple
//prev(it)   next(it)
const int mod = 1e9+7;
int  n,m;
int ax, bx,ay,by;
int gcd(int a,int b){
	if(!b)return a;
	return gcd(b,a%b);
}
int lcm(int a,int b){
	return a*b/gcd(a,b);
}
int exgcd(int a, int b,int &x,int &y)
{
    if (b == 0)
    {
        x = 1, y = 0;
        return a;
    }
    int d=exgcd(b, a % b,y,x);
    y -= a / b * x;
    return d;
}
void solve()
{
	cin>>n>>m;
	int sum=0;
	for(int i=1;i<=n;i++){
		cin>>ax;
		sum+=ax;
	}
	int ca=sum%m;
	ax=n;bx=n*(n+1)/2;
	int cc=gcd(ax,bx);cc=gcd(cc,m);
	int ans=inf;
	sum%=m;ans=sum;
	int ta=0;
	if(sum<m){
		int gg=m-sum;
		if(gg%cc==0){
			ta+=gg/cc;
			ans=0;
		}
		else {
			gg=gg/cc+1;
			ta+=gg;
			sum+=gg*cc;
			ans=min(ans,sum%m);
		}
	}
	cout<<ans<<"\n";
	if(ans==ca){
		cout<<"0 0\n";
	}
	else{
		int gg=m+ans-ca;
		int x,y;
		exgcd(ax,bx,x,y);
		int gx,gy;
		exgcd(cc,m,gx,gy);
		if(gy<0){
			x*=-gy;y*=-gy;
		}
		x=x*ta,y=y*ta;
		while(x<0){
			x+=lcm(ax,m)/ax;
		}
		while(y<0){
			y+=lcm(bx,m)/bx;
		}
		cout<<x<<" "<<y<<"\n";
		//cout<<gg<<"\n";
	}
}
signed main()
{
	cin.tie(0)->sync_with_stdio(0);
	int _ = 1;
	//cin >> _;
	while (_--)
	{
		solve();
	}
}