#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
#define endl '\n'
#define debug(x) cout<<#x<<": "<<x<<endl
#define lowbit(x) (x&-x)
#define gcd __gcd
#define i128 __int128
#define rep(i,a,b) for(ll i=(a);i<=(b);i++)
#define per(i,a,b) for(ll i=(a);i>=(b);i--)
#define fi first 
#define se second 
const int N=1e5+10,M=2e5+10;
const ll mod=998244353;
const double eps=1e-12;
const double pi=acos(-1.0);
const double pi1=pi/180,pi2=180/pi;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//unordered_map<int,int>mp;
#define poly vector<ll>

ll exgcd(ll a,ll b,ll &x,ll &y)//返回gcd(a,b)
{
	if(b==0)
	{
		x=1,y=0;
		return a;
	}
	ll x1,y1,d;
	d=exgcd(b,a%b,x1,y1);
	x=y1,y=x1-a/b*y1;
	return d;
}

void solve()
{
	ll n,m;
	cin>>n>>m;
	ll sum=0;
	for(int i=1;i<=n;i++)
	{
		ll x;
		cin>>x;
		sum+=x;
	}
	ll g,p;
	ll a=__gcd(__gcd(n,n*(n+1)/2),-m),b=-1;
	exgcd(a,b,g,p);
	ll num=-sum/__gcd(a,b);
	ll mo=abs(a/__gcd(a,b));
	p=(p*num%mo+mo)%mo;
	ll t,k;
	a=__gcd(n,n*(n+1)/2),b=-m;
	exgcd(a,b,t,k);
	t*=(p-sum)/__gcd(a,b);
	ll s,d;
	a=n,b=n*(n+1)/2;
	exgcd(a,b,s,d);
	s*=t,d*=t;
	cout<<p<<endl;
	cout<<(s%m+m)%m<<" "<<(d%m+m)%m<<endl;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);

    int T=1;
    //cin>>T;
    while(T--)
    {
        solve();
    }
    return 0;
}