#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> PII;
#define endl "\n"
#define ft first
#define sd second
#define pb push_back
const int MOD = 1e9 + 7;
int n,m;
int gcd(int a,int b){
    if(!b) return a;
    else return gcd(b,a % b);
}
int exgcd(int a,int b,int &x,int &y){
    if(!b){
        x = 1,y = 0;
        return a;
    }
    int d = exgcd(b,a % b,y,x);
    y -= a / b * x;
    return d;
}
void solve() {
    cin>>n>>m;
    vector<int> v(n + 1);
    int sum = 0;
    for(int i = 1;i <= n;i++){
        cin>>v[i];
        sum = (sum + v[i]) % m;
    }
    int a = n,b = n * (n + 1) / 2;
    int g1 = gcd(a,b),g2 = gcd(g1,m);
    //int k2 = sum / g2,ans = sum - k2 * g2;
    int ans = sum % g2;
    int k2 = ((ans - sum + m) / g2) % m;
    cout<<ans<<endl;
    int k1,t;
    int d1 = exgcd(g1,m ,k1,t);
//	cout<<k1<<' '<<t<<' '<<g1 * k1 + m * t<<endl;
    k1 *=k2;
    int x1,y1;
    int d2 = exgcd(a,b,x1,y1);
//    cout<<x1<<' '<<y1<<endl;
//    cout<<x1 *  a + y1 * b <<' '<<g1<<endl;
    x1 *=k1,y1 *=k1;
//    cout<<x1 *  a + y1 * b <<' '<<g1<<endl;
    x1 = (x1 + m) % m;
    y1 = (y1 + m) % m;
    cout<<x1<<' '<<y1<<endl;
//    cout<<ans<<' '<<sum<<' '<<k1<<' '<<k2<<endl;
//	cout<<g1<<' '<<g2<<endl;
    return ;
}
signed main() {
//	ios::sync_with_stdio(0);
//	cin.tie(0);
//	cout.tie(0);
    int T = 1;
//	cin>>T;
    while(T--)
        solve();
    return 0;
}