#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<set>
#include<stack>
#include<map>
#include<array>
#include<queue>
#include<cstring>
#include<stdio.h>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<unordered_map>
#include<random>
#include<bitset>
#include <functional>
//#include <bits/stdc++.h>
typedef long long ll;//unsigned 
typedef long double ld;
#define pii pair<int,int>
#define pip pair<int,pii>
#define pb push_back
#define fi first
#define se second
#define lowbit(x) (x&-x)
#define f(x)(y) x+y
#define int ll
using namespace std;
minstd_rand gen;
const ld PI = 3.14159265358979323846264338327950288419716939937510L;
const ld eps = 1e-10;

const int N = 100010, M = 20010;
ld a[N];
ll gcd(ll x, ll y)
{
	if (x > y)
		swap(x, y);
	if (x == 0)return y;
	return gcd(y % x, x);
}
ll moni(ll x, ll p)
{
	if (x == 1)
		return 1;
	return ((1 - p * moni(p % x, x)) / x + p * p) % p;
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	ll n, m; cin >> n >> m;
	ll sum = 0;
	for (int i = 1; i <= n; i++)
	{
		int a; cin >> a;
		sum += a;
	}
	ll x, y;
	ll kk[2];
	int GCD = gcd(n, m);
	{
		int k = sum % GCD;
		kk[0] = k;
		if (k == sum)
		{
			x = 0;
			goto door;
		}
		int right = (k - sum + m) % m;
		x = right / GCD * moni(n / GCD, m / GCD) % m;
	}
door:;
	{
		int k = (sum + n * (n + 1) / 2) % GCD;
		kk[1] = k;
		if (k == sum)
		{
			y = 0;
			goto door1;
		}
		int right = (k - sum + m - n * (n + 1) / 2 % m + m) % m;
		y = right / GCD * moni(n / GCD, m / GCD) % m;
	}
door1:;
	if (kk[0] < kk[1])
		cout << kk[0] << '\n' << x << ' ' << 0;
	else
		cout << kk[1] << '\n' << y << " " << 1 % m;
	
}
/*
6
0 0
1 -1 
2 0
2 1 
1 1 
0 1

*/