#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve(){
	int n,m;cin>>n>>m;
	vector<int>a(n+1);
	int sum=0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		sum+=a[i];
	}
	sum=m-sum%m;
	int c1,c2;
	if(n%2!=0){
		int g=__gcd(n,m);
		int p=n/g,q=m/g;
		int x,y;
		for(int i=0;i<=n;i++){
			if((i*q+1)%p==0){
				x=(i*q+1)/p;
				break;
			}
		}
		int dis1=sum-(sum/g)*g,dis2=(sum/g)*g+g-sum;
		x%=m;
		if(dis1<=dis2){
			cout<<dis1<<"\n";
			cout<<(x*((sum/g)%m))%m<<" "<<"0"<<"\n";
			return;
		}else{
			cout<<dis2<<"\n";
			cout<<((x*((sum/g)%m))%m+x)%m<<" "<<"0"<<"\n";
			return;
		}
	}else{
		int g=__gcd(n/2,m);
		int cnt1,cnt2;//n/2 : cnt1+cnt2;
		int km=m*(n/2);
		km=km*((n+1)/km)+km;
		if(km%2==0){
			cnt2=1;
			cnt1=(km+1-n-1)/2;
		}else{
			cnt1=(km+1)/2;
			cnt2=0;
		}
//		cout<<cnt1<<" "<<cnt2<<" :"<<cnt1*n+cnt2*n*(n+1)/2<<" "<<(cnt1*n+cnt2*n*(n+1)/2)%m<<"\n";
		int p=(n/2)/g,q=m/g;
//		cout<<g<<" "<<p<<"*"<<q<<"\n";
		int x,y;
		for(int i=0;i<=n;i++){
//			cout<<(i*q+1)<<" "<<p<<"\n";
			if((i*q+1)%p==0){
				x=(i*q+1)/p;
				break;
			}
		}
//		cout<<x<<"\n";
		int dis1=sum-(sum/g)*g,dis2=(sum/g)*g+g-sum;
//		cout<<cnt1<<" "<<cnt2<<" "<<x<<" "<<sum<<" "<<g<<"\n";
		cnt1%=m;cnt2%=m;x%=m;
		if(dis1<=dis2){
			cout<<dis1<<"\n";
		    c1=(cnt1*((x*((sum/g)%m)%m)%m))%m,c2=(cnt2*((x*((sum/g)%m)%m)%m))%m;
			cout<<c1<<" "<<c2<<"\n";
//			cout<<(m-sum+c1*n+c2*n*(n+1)/2)%m<<"\n";
			return;
		}else{
			cout<<dis2<<"\n";
			c1=(cnt1*(((x*((sum/g)%m)%m)%m+x)%m))%m,c2=(cnt2*(((x*((sum/g)%m))%m+x)%m))%m;
			cout<<c1<<" "<<c2<<"\n";
//			cout<<(m-sum+c1*n+c2*(n+1)*n/2)%m<<"\n";
			return;
		}
	}
}
signed  main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	int t=1;
	//cin>>t;
	while(t--){
		solve();
	}
}