#include <bits/stdc++.h>
#define int long long
#define io ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pb push_back
using namespace std;
const int N=1e6+5,mod1=1e9+7,mod2=998244353;
typedef pair<int,int> pi;
int a[N];
int exgcd(int a, int b, int& x, int& y)
{
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  int d = exgcd(b, a % b, x, y);
  int temp = x;
  x = y;
  y = temp - a / b * y;
  return d;
}
void solve()
{
    int n,m;
    cin>>n>>m;
    int sum=0;
    for(int i=1;i<=n;i++)cin>>a[i],sum+=a[i];
    int s0,d0;
    int d1=exgcd(n,n*(n+1)/2,s0,d0);
    int d2=gcd(d1,m);
    int z=-sum/d2;
    //if((-sum)%d2!=0)z++;
    int k1,k2;
    exgcd(d1,m,k1,k2);
    k1*=z;
    s0*=k1,d0*=k1;
    s0=(s0%m+m)%m;
    d0=(d0%m+m)%m;
    cout<<(sum+n*s0+n*(n+1)/2*d0)%m<<'\n';
    cout<<s0<<' '<<d0;
}
signed main()
{
    io;
    int t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}