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

#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define int long long
#define pi pair<int, int>
#define yyy cout<<"Yes\n"
#define nnn cout<<"No\n"
#define int128 __int128_t

const int N = 2e6 + 5;
int m, n;

void solve()
{
    cin >> n >> m;
    int sum = 0;
    int Nn = n;
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        sum += x;
    }
    sum %= m;
    int ans = m, k = 0;
    if(Nn % 2 == 1) {
        int flag = -1, s = 0;
        for (int i = 0; i < 10000000 ; i += 2) {
            int t = (n * i % (2 * m) - (2 * m - 2 * sum));
            if(t >= 0 && t % 2 == 0) {
                if(flag == -1) {
                    flag = t;
                }
                if(ans > t / 2) {
                    ans = t / 2;
                    k = i;
                }
                s++;
                if(s > 1 && t == flag) break;
            }
            
        }
    }
    else {
        int flag = -1, s = 0;
        for (int i = (Nn + 1); i < 10000000 ; i += 2) {
            int t = (n * i % (2 * m) - (2 * m - 2 * sum));
            if(t % 2 == 0 && t >= 0) {
                if(flag == -1) flag = t;
                if(ans > t / 2) {
                    ans = t / 2;
                    k = i;
                }
                s++;
                if(s > 1 && flag == t) break;
            }
            
        }
    }
    cout << (ans == m ? 0 : ans) << '\n';
    cout << k % (Nn + 1) / 2 << " " << k / (Nn + 1);
}

signed main()
{
    ios;
    int t = 1;
    //cin >> t;
    while (t--) solve();
    return 0;
}