#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 a, b, s, d, n, m, sum;
int exgcd(int ta, int tb, int &x, int &y)
{
    if (!tb)
    {
        x = 1;
        y = 0;
        return ta;
    }
    int d = exgcd(tb, ta % tb, y, x);
    y -= (ta / tb) * x;
    return d;
}
void solve()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        int x;
        cin >> x;
        sum += x;
    }
    a = n, b = (n + 1) * n / 2;
    int g1 = __gcd(a, b);
    int g2 = __gcd(g1, m);
    int ans = sum % g2,k2 = (ans - sum) / g2;
    int x,y,k1,t;
    int d1 = exgcd(g1,m,k1,t);
    k1 = (k1 * k2) % m;
    int d = exgcd(a,b,x,y);
    x = (x * k1 + m) % m;
    x = (x + m) % m;
    y = ((y * k1 + m) % m + m) % m;
    cout<<ans<<endl;
//    cout<<(sum + a * x + b * y) % m<<endl;
    cout<<x<<' '<<y<<endl;
    return;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    while (T--)
        solve();
    return 0;
}
/*
6 24
1 1 4 5 1 4

7 29
1 9 1 9 8 1 0

*/