#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define endl '\n'
#define ll long long

ll extend_gcd(ll a,ll b,ll &x,ll &y)
{
    if(b==0)
    {
        x=1;
        y=0;
        return a;
    }
    ll d=extend_gcd(b,a%b,y,x);
    y-=a/b*x;
    return d;
}


const int N=1e5+10;

int tt;
ll n;

ll m;

ll sum;

ll x,y;




int main()
{
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  //  freopen("ain.txt","r",stdin);freopen("aout.txt","w",stdout);
    
    ll gcdd=0;
    cin>>n>>m;
    rep(i,1,n)
    {
        ll temp;
        cin>>temp;
        sum+=temp;
    }
    sum%=m;
    gcdd=__gcd(m,__gcd(  n,(1+n)*n/2   ));

    //cout<<gcdd;

    ll cishu=(m-sum+gcdd-1)/gcdd;
    ll add=cishu*gcdd%m;

    cout<<(sum+add)%m<<endl;

    rep(i,0,100000)
    {
        ll c=add+i*m;
        ll a,L;
        a=n;
        L=(1+n)*n/2;
        ll d=extend_gcd(a,L,x,y);
        ll minx=((x*(c/d) %(L/d)+(L/d)   )  )%(L/d);
        ll miny=(c-minx*a)/L;
        if(miny>=0)
        {
            cout<<minx<<" "<<miny;
            exit(0);
        }
    }
    


    return 0;
}