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

int n, m;
int a[100005];
int sum = 0;
int extend_gcd(int a, int b, int &x, int &y) {
	if (b == 0) {
		x = 1;
		y = 0;
		return a;
	}
	int d = extend_gcd(b, a % b, y, x);
	y -= a / b * x;
	return d;
}

int gcd(int a, int b) {
	return b ? gcd(b, a % b) : a;
}

void solve() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		sum += a[i];
	}
	sum %= m;
	int cnt = sum;
	sum = m - sum;
	int xx = n * (n + 1) / 2;
	int yy = n;
	int s = 0, d = 0;
	int q = extend_gcd(xx, yy, d, s);
	int s1 = 0, d1 = 0;
	int t = extend_gcd(q, m, d1, s1);
	int ans = 0;
	if (sum % t) {
		d1 = d1 * (1 + (sum / t));
		ans = ((sum / t) + 1) * t - sum;
	} else {
		d1 = d1 * (sum / t);
		ans = (sum / t) * t - sum;
	}
	ans %= m;
	d = d1 * d, s = d1 * s;
	while (d < 0) {
		d += m;
	}
	while (s < 0) {
		s += m;
	}
	s %= m;
	d %= m;
	if (ans > cnt) {
		cout << cnt << endl;
		cout << 0 << " " << 0 << endl;
		return;
	}
	cout << ans << endl;
	cout << s << " " << d << endl;
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int tt = 1;
	//cin >> tt;
	while (tt--) {
		solve();
	}
	return 0;
}