// Problem: A. Modulo Ruins the Legend
// Contest: Codeforces - The 2022 ICPC Asia Hangzhou Regional Programming Contest
// URL: https://codeforces.com/gym/104090/problem/A
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

//MD OI赛制出Subtask是真的SB
//我是废物，我爱贺题！！！
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,x,y,z) for(long long i=x;i<=y;i+=z)
#define fd(i,x,y,z) for(long long i=x;i>=y;i-=z)
ll n,m;
ll yi,er;
ll ans1,ans2;
ll sum;
ll exgcd(ll a,ll b,ll &x,ll &y){
	if(b==0){
		x=1,y=0;
		return a;
	}
	ll d=exgcd(b,a%b,x,y);
	ll z=x;
	x=y;
	y=z-y*(a/b);
	return d;
}
int main(){
	scanf("%lld%lld",&n,&m);
	f(i,1,n,1){
		ll xx;
		scanf("%lld",&xx);
		sum+=xx;
	}
	if(n==1){
		printf("0\n%lld 0\n",(m-sum%m)%m);
		return 0;
	}
	yi=n;
	er=n*(n+1)/2;
	ll ff=__gcd(yi,er);
	ll kk=(m-sum%m)%m;
	ll hh=(kk/ff+(kk%ff==0?0:1))*ff-kk;
	printf("%lld\n",hh);
	if(kk==0){
		printf("0 0\n");
		return 0;
	}
	hh+=kk;
	exgcd(yi,er,ans1,ans2);
	ll nm=hh/ff;
	ans1*=nm;
	ans2*=nm;
	while(ans1<0){
		ans1+=m;
	}
	while(ans2<0){
		ans2+=m;
	}
	printf("%lld %lld\n",ans1,ans2);
	return 0;
}