#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,m;
int a[100005];
void exgcd(int a,int b,int &x,int &y){
	if(b==0){x=1,y=0;return;}
	exgcd(b,a%b,x,y);
	//bx+(a-(a/b)*b)y=1.
	int ty=y;
	y=x-(a/b)*y;
	x=ty;
}
signed main(){
	cin>>n>>m;
	int tt=0;
	for(int i=1;i<=n;i++)cin>>a[i],tt+=a[i],tt%=m;
	int p=(n+1)*n/2;p%=m;
	int b=__gcd(p,m);
	//b的倍数
	int bb=__gcd(n,m);
	int x=__gcd(b,bb);
	//xp+tt%m.
	int pp=(m-tt+x-1)/x;
	cout<<(((m-tt+x-1)/x)*x%m+tt)%m<<"\n";
	pp*=x,pp%=m;
	int tx,ty;
	exgcd(b,bb,tx,ty);
	
	tx%=m,ty%=m;
	//cout<<b<<" "<<bb<<" "<<pp<<" "<<tx<<" "<<ty<<"\n";
	tx*=pp/__gcd(b,bb),ty*=pp/__gcd(b,bb);
	b*=tx,bb*=ty;b%=m,bb%=m;
	//cout<<b<<" "<<bb<<"\n";
	exgcd(p,m,tx,ty);
	//cout<<tx<<" "<<ty<<"\n";
	//21x-24y=9
	//x=5 y=4
	tx+=m,tx%=m;
	//21x mod 24=9.
	//16+21*21%24
	//
	ty=(m-ty)%m;ty+=m,ty%=m;
	//cout<<tx<<" "<<ty<<"\n";
	tx*=(b/__gcd(p,m));
	vector<int> r;r.push_back(tx%m);
	exgcd(n,m,tx,ty);
	tx+=m,tx%=m;
	ty=(m-ty)%m;ty+=m,ty%=m;
	tx*=(bb/__gcd(n,m));
	cout<<tx%m<<" "<<r[0];
	return 0;
	//16+5*21
	//d=5 s=0.
	//21x 9 mod 24.
	//21x 3.
	//6x 0.
	//p*d -my=b
	//p*d+n*s+tt mod m.
	//b*i+bb*j+tt mod m
	//i*3+j*6=9
	//bb的倍数.
	for(int i=0;i<m;i++){
		for(int j=0;j<m;j++)cout<<(b*i+bb*j)%m<<"\n";
	}
	//
	//
	//tt+n*(n+1)/2*d%m+s*n%m
	return 0;
}