#include<bits/stdc++.h>
#define int long long

using namespace std;
typedef pair<int, int> pii;
const int N = 2e5 + 10;

void solve() {
    int n, mod;
    cin >> n >> mod;

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

    int mn = sum;
    pii ans = { 0,0 };
    int k = n * (n + 1) / 2;

    map<int, int> mp;
    for (int s = 0; s <= n + 1; s++) {

        int now = sum + s * n;
        now %= mod;
        int all = 0;
        int mns = 1e13;

        while (!mp[now] && all < mod - 1 && now < mns) {
            mns = now;
            mp[now] = 1;
            int l = 0, r = mod - all - 1;
            while (l < r) {
                int mid = (l + r) >> 1;
                if (now + mid * k < mod) l = mid + 1;
                else r = mid;
            }
            now += l * k;
            now %= mod;
            all += l;
            if (now < mn) {
                ans = { s,all };
                mn = now;
            }
        }
    }

    cout << mn << "\n";
    cout << ans.first << " " << ans.second;
}
signed main() {
    int _ = 1;
    //cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}