#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const ll INF=1e18;
ll exgcd(ll a,ll b ,ll &x, ll &y)
{
	if(!b)
	{
		x=1;
		y=0;
		return a;
	}
	ll ans=exgcd(b,a%b,x,y);
	ll x0=x,y0=y;
	x=y0,y-=x0-a/b*y0;
	return ans;
}
void solve(){
	
	int n,m;
	cin>>n>>m;
	ll sum=0;
	for(int i=1;i<=n;i++)
	{
		int x;
		cin>>x;
		sum+=x;
	}
	ll k=1ll*n*(n+1)/2;
	ll g=__gcd(n,m);
	ll ans=INF,pp,ansd;
	for(int i=0;i<=500000;i++)
	{
		ll s=sum+1ll*i*k;
		s%=m;
		ll s1=s;
		s=m-s;
		ll l=0,r=1e9,pos;
		while(l<=r)
		{
			ll mid=(l+r)/2;
			if(mid*g>=s){
				r=mid-1;
				pos=mid;
			}
			else
				l=mid+1;
		}
		s1=(s1+g*pos)%m;
		if(s1<ans)
		{
			ans=s1;
			ansd=i;
			pp=pos*g;
			
		}
	}
	cout<<ans<<'\n';
	ll x,y;
	ll d=exgcd(n,m,x,y);
	ll cnt=pp/d;
	x*=cnt;
	ll res=abs(m/d);
	cout<<(x%res+res)%res<<' ';
	cout<<ansd;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int T = 1;
	while(T--){
		solve();
	}
	
	return 0;
}