//这回只花了114514min就打完了。
//真好。记得多手造几组。
#include <bits/stdc++.h>
#define int long long
#define pai 3.141592653589793238462643383279502884197169399375105820
#define MOD 1000000007
#define eps 0.00000001
inline int min(int a,int b) {return a<b?a:b;}
inline int max(int a,int b) {return a>b?a:b;}
#define ULL unsigned long long
#define LL long long
#define INF 0x3f3f3f3f
#define INF_LL 0x3f3f3f3f3f3f3f3f
static char buf[1000000],*paa=buf,*pd=buf;
static char buf2[1000000],*pp=buf2;
#define getchar() paa==pd&&(pd=(paa=buf)+fread(buf,1,1000000,stdin),paa==pd)?EOF:*paa++
inline void pc(char ch){
	if(pp-buf2==1000000) fwrite(buf2,1,1000000,stdout),pp=buf2;
	*pp++=ch;
}
inline void pcc(){
	fwrite(buf2,1,pp-buf2,stdout);
	pp=buf2;
}
inline int read(void) {
	int w=1;
	register int x(0);register char c(getchar());
	while(c<'0'||c>'9') {if(c=='-') w=-1;c=getchar();}
	while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return w*x;
}
void write(int x) {
	if(x<0) pc('-'),x=-x;
	static int sta[20];
	int top=0;
	do {
		sta[top++]=x%10,x/=10;
	} while(x);
	while(top) pc(sta[--top]+48);
}
void we(int x) {
	write(x);
	pc('\n');
}
inline bool cmp_xi(int a,int b) {return a<b;}
inline bool cmp_da(int a,int b) {return a>b;}
int N,M,a[1000009],as;
void exgcd(int x,int y,int z,int& xx,int& yy) {
	if(y==0) {
		xx=z/x;
		yy=0;
		return;
	}
	//y y%x
	exgcd(y,x%y,z,yy,xx);
	yy+=(x-x%y)/y*xx;
}
void ff(int x,int y,int z,int w) {
	z+=w;
	z%=w;
	int a,b;
	exgcd(x,y,z,a,b);
	a=(a%w+w)%w;
	b=(b%w+w)%w;	
	printf("%lld %lld\n",a,b);
}
signed main(void) {
    //freopen("m.in","r",stdin);
    //freopen("m.out","w",stdout);
	N=read();M=read();
	for(int i=1;i<=N;i++) {
		a[i]=read();
		as=(as+a[i])%M;
	}
	if(N%2==1) {
		int v=std::__gcd(N,M);
		printf("%lld\n",as%v);
		ff(N,N*(N-1)/2,as%v-as,M); 
	} else {
		int v=std::__gcd(N/2,M);
		printf("%lld\n",as%v);
		ff(N,N*(N-1)/2,as%v-as,M); 		
	}
    return 0;
}