#pragma GCC optimize(2)
#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define int long long
#define endl '\n'
using i128 = __int128;
using i64 = long long;
using f128 = long double;
using u64 = unsigned long long;
using pii = pair<int, int>;
const int INF = 0x3f3f3f3f, mod = 1e9 + 7;
const i64 inf = 2e18;
//-------------------------------------------
void solve()
{
    int n, m;
    cin >> n >> m;
    int C = 0;
    for (int i = 1, a; i <= n; i++)
    {
        cin >> a;
        C += a;
    }
    int A = n, B = n * (n + 1) / 2, ans = inf;
    set<int> se1;
    pii res;
    for (int i = 0; i <= m; i++)
    {
        int w1 = (A * i + C) % m;
        if (se1.count(w1))
            break;
        se1.insert(w1);
        set<int> se2;
        for (int j = 0; j <= m; j++)
        {
            int w2 = (A * i + B * j + C) % m;
            if (se2.count(w2))
                break;
            se2.insert(w2);
            if (ans > w2)
            {
                ans = w2;
                res = {i, j};
            }
            ans = min(ans, w2);

            // cerr << i << " " << j << " " << (A * i + B * j + C) % m << endl;
        }
    }

    cout << ans << endl
         << res.x << " " << res.y << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T = 1;
    // cin >> T;
    for (int i = 1; i <= T; i++)
        solve();
    return 0;
}