#include <iostream>
using namespace std;
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <cstring>

using ll = long long;

const int N = 1e5 + 10;
ll n, m;
ll sum;

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

ll gcd(ll a, ll b)
{
	if (a < b) swap(a, b);
	return b ? gcd(b, a % b) : a;
}

void solve()
{
	cin >> n >> m;
	for (int i = 1;i <= n;i++)
	{
		ll t;
		cin >> t;
		sum += t;
	}
	ll y = 0, s = 0;
	ll ans1 = sum % gcd(n, m);
	ll ans2 = (sum + n * (n + 1) / 2) % gcd(n, m);
	if (ans1 <= ans2)
	{
		cout << ans1 << '\n';
		ll d = exgcd(m, n, y, s);
		s = -s;
		s *= (sum - ans1) / gcd(n, m);
		ll mod = m / gcd(m, n);
		cout << (s % mod + mod) % mod << ' ' << 0 << '\n';
	}
	else
	{
		cout << ans2 << '\n';
		ll d = exgcd(m, n, y, s);
		s = -s;
		s *= (sum + n * (n + 1) / 2 - ans2) / gcd(n, m);
		while (s < 0) s += m / gcd(m, n);
		ll mod = m / gcd(m, n);
		cout << (s % mod + mod) % mod << ' ' << 1 << '\n';
	}
}

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