#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <cmath>
#include <stack>
#include <cstring>
#include <iomanip>
#include <unordered_map>
#include <numeric>

#define sc_int(x) scanf("%d", &x)

#define x first
#define y second
#define pb push_back

using namespace std;

const int N = 2e5 + 10, M = 50, MOD =  998244353;
const int inf = 1e9;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef pair<char, int> PCI;
typedef pair<string, string> PSS;

LL n, m;

void solve() 
{
    cin >> n >> m;
    LL sum = 0;
    for(int i = 0; i < n; i ++)
    {
        LL x;
        cin >> x;
        sum += x;
    }
    sum %= m;
    LL q = n * (1 + n) / 2;
    LL ans = m;
    LL resd = -1, ress = -1;
    LL d = __gcd(n, m);
    for(LL i = 0; i * i <= m; i ++)
    {
        LL t = (q * i + sum) % m;
        if(t < ans)
        {
            ans = t;
            resd = i, ress = 0;
        }
        t = m - t;
        LL p = (t + d - 1) / d * d;
        if(p - t < ans)
        {
            ans = p - t;
            resd = i, ress = (p * n / __gcd(n, p)) / n;
        }
        if(i)
        {
            LL k = m / i;
            t = (q * k + sum) % m;
            if(t < ans)
            {
                ans = t;
                resd = k, ress = 0;
            }
            t = m - t;
            LL p = (t + d - 1) / d * d;
            if(p - t < ans)
            {
                ans = p - t;
                resd = k, ress = (p * n / __gcd(n, p)) / n;
            }
        }
    }
    cout << ans << endl;
    cout << ress << " " << resd << endl;
}


int main()
{
    //  freopen("input.txt","r",stdin);
    //  freopen("output.txt","w",stdout);
    // ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    
    int T = 1;
    // cin >> T;
    while(T -- )
    {
        solve();
    }
}