#include <bits/stdc++.h>
using namespace std;
using LL = long long;

template<typename T>
T exgcd(T a, T b, T &x, T &y){
    if (!b){
        x = 1, y = 0;
        return a;
    }
    T r = exgcd(b, a % b, y, x);
    y -= a / b * x;
    return r;
}

// a * x = b (mod m) or b / a (mod m)
array<LL, 2> modequ(LL a, LL b, LL m){
    LL x, y;
    LL g = exgcd(a, m, x, y);
    if (b % g) return {-1, -1};
    m /= g, a /= g, b /= g;
    x = 1LL * x * b % m;
    if (x < 0) x += m;
    return {x, m};
}

// a * x + b * y = c
array<LL, 4> modequ1(LL a, LL b, LL c){
    LL x, y;
    LL d = exgcd(a, b, x, y);

    if (c % d)  {
        return {-1, -1, -1, -1};
    }

    x *= c / d, y *= c / d;

    LL k1 = b / d, k2 = a / d;

    LL t1 = x / k1;

    x -= t1 * k1;

    y += t1 * k2;

    if (x < 0) {
        x += k1;
        y -= k2;
    }

    return {x, y, k1, k2};
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    LL n, m;
    cin >> n >> m;

    LL tot = 0;
    for (int i = 0; i < n; ++i) {
        int a;
        cin >> a;
        tot += a;
    }
    LL M = gcd(n * (n + 1) / 2, gcd(n, m));
    LL ans = tot % M;

    auto [x, y, k1, k2] = modequ1(n, n * (n + 1) / 2, ((ans - tot) % m + m) % m);     
    cout << ans << '\n';
    y %= m;
    if (y < 0) {
        y += m;
    }
    cout << x << ' ' << y << '\n';
    return 0;
}