// 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 __int128_t
#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;
inline ll rd() {
	ll x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9') {
		if(ch=='-')
			f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9') {
		x=x*10+ch-'0';
		ch=getchar();
	}
	return x*f;
}

inline void write(ll x) {
	if(x<0) {
		putchar('-');
		x=-x;
	}
	if(x>9)
		write(x/10);
	putchar(x%10+'0');
}

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(){
	n=rd(),m=rd();
	f(i,1,n,1){
		ll xx;
		xx=rd();
		sum+=xx;
	}
	if(n==1){
		puts("0");write((m-sum%m)%m);printf(" 0\n");
		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;
	write(hh);
	puts("");
	//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;
	}
	write(ans1);
	printf(" ");
	write(ans2);
	puts("");
	//printf("%lld %lld\n",ans1,ans2);
	return 0;
}