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

#define int long long  

int exgcd(int a, int b, int &x, int &y) {
    if (!b) {
        x = 1, y = 0;
        return a;
    }
    int g = exgcd(b, a % b, y, x);
    y -= a / b * x;
    return g;
}

bool liEu(int a, int b, int c, int& x, int& y) {
    int d = exgcd(a, b, x, y);
    if (c % d != 0) 
        return false;
    int k = c / d;
    x *= k;
    y *= k;
    return true;
}

int norm(int x, int m) {
	while (x < 0) {
		x += m;
	}
	if (x >= m) {
		x %= m;
	}
	return x;
}

signed main() {  
    ios::sync_with_stdio(false);
    cin.tie(nullptr);  

	int n, m;
	cin >> n >> m;

	int a = 0;
	for (int i = 1; i <= n; i++) {
		int x;
		cin >> x;
		a = (a + x) % m;
	}

	int b = n % m, c = (n + 1) * n / 2 % m;
	int g = gcd(b, c);
	if (g == 0) {
		cout << a << "\n";
		cout << 0 << " " << 0 << "\n";
		return 0;
	}

	g = gcd(g, m);

	int t = m / g;
	int ans = LLONG_MAX;
	int k = 0;

	int now = 0;
	while (now < t) {
		int sum = a + now * g;
		assert(sum >= 0);
		if (ans > sum % m) {
			ans = sum % m;
			k = now;
		}
		if (ans == 0) {
			break;
		}
		int u = (sum + m - 1) / m * m;
		int add = (u - sum + g - 1) / g;
		now += add;
	}

	int x, y;
	liEu(b, c, k * g, x, y);
	x = norm(x, m);
	y = norm(y, m);

	assert(ans != LLONG_MAX);
	// assert(ans == (a + x * b + y * c) % m);
	cout << ans << "\n";
	cout << x << " " << y << "\n";

    return 0;
}