#include <bits/stdc++.h>
using namespace std;
#define xx first
#define yy second
#define endl "\n"
#define pb push_back
#define int long long
#define ll long long
#define lowbit(x) x & (-x)
typedef pair<int, int> pii;
#define LF(x) fixed << setprecision(x)
#define Yshanqian ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
const int N = 1e6 + 10, M = 1010, inf = 0x3f3f3f3f, mod = 1e9 + 7, P = 13331;
int n, m;
int num[N];
int sum;
void exgcd(int a, int b, int &x, int &y)
{
    if (!b)
    {
        x = 1, y = 0;
        return;
    }
    int x1, y1;
    exgcd(b, a % b, x1, y1);
    x = y1, y = x1 - a / b * y1;
}
void solve()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        cin >> num[i], sum += num[i];

    sum %= m;

    int a = n, b = n * (n + 1) / 2;

    int g = gcd(a, b);
    int t = gcd(g, m);
    int q = (m - sum + t - 1) / t;
    int ans = (q * t + sum) % m;

    int x, y;
    exgcd(g, m, x, y);

    int base = (ans - sum) / t;
    x *= base, y *= base;

    int xx, yy;
    exgcd(a, b, xx, yy);
    xx *= x, yy *= x;
    cout << ans << endl;

    cout << (xx % m + m) % m << ' ' << (yy % m + m) % m << endl;
}
signed main()
{
    Yshanqian;
    int T;
    T = 1;
    // cin >> T;
    for (int cases = 1; cases <= T; ++cases)
    {
        // cout<<"Case #"<<cases<<": ";
        solve();
    }
    return 0;
}