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

#define vcoistnt ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); 
#define int long long
#define ull unsigned long long
#define lowbit(x) ((x)&-(x))
typedef pair<int,int> pll;

const int N=2e5+10;
const int INF=0x3f3f3f3f3f3f3f3f;
const int inf=INT_MIN;
const int mod=998244353;
const int base=283;


void solve(){
    int n,m;
    cin>>n>>m;
    int sum=0;
    for(int i=1;i<=n;i++){
        int x;cin>>x;
        sum+=x;
    }
    int a=n,b=(n+1)*n/2;
    sum%=m;
    if(n%2){
        int mi=INF;
        int x=-1;
        for(int i=0;i<m;i++){
            int t=(sum+i*a)%m;
            if(t<mi){
                mi=t;
                x=i;
            }
            if(mi==0) break;
        }
        cout<<mi<<"\n";
        cout<<x<<" "<<0<<"\n";
    }else{
        int flag=1;
        int t=n/2;
        int mi=INF;
        int x=-1;
        for(int i=0;i<m;i++){
            if(i>t){
                int y=(sum+i*n)%m;
                int yy=(sum+i*n+n/2)%m;
                if(y<mi){
                    flag=1;
                    mi=y;
                    x=i;
                }
                if(yy<mi){
                    mi=yy;
                    x=i;
                    flag=0;
                }
                if(mi==0){break;}
            }else{
                int y=(sum+i*n)%m;
                if(y<mi){
                    flag=1;
                    mi=y;
                    x=i;
                }
                if(mi==0) break;
            }
        }
        if(flag==0){
            cout<<mi<<"\n";
            cout<<x-t<<" "<<1<<"\n";
        }else{
            cout<<mi<<'\n';
            cout<<x<<" "<<0<<"\n";
        }
    }
}
signed main() {
    vcoistnt
    int _=1;
    // cin>>_;
    while(_--) {
        solve();
    }
    return 0;
}