// Problem: A - Modulo Ruins the Legend
// Contest: Virtual Judge - 过什么520做题要紧
// URL: https://vjudge.net/contest/559671#problem/A
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// Date:2023-05-20 07:53:13
// By:SmallBlack
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;
inline long long read()
{
	long long s=0,k=1;
	char c=getchar();
	while(!isdigit(c))
	{
		k=(c=='-')?-1:1;
		c=getchar();
	}
	while(isdigit(c))
	{
		s=s*10+c-'0';
		c=getchar();
	}
	return s*k;
}
#define d read()
#define ll long long
#define Maxn 10010
#define Size 10010
#define mp make_pair
#define pb push_back
#define fi first
#define se second
ll exgcd(ll a,ll b,ll &x,ll &y)
{
	if(b==0)
	{
		x=1,y=0;
		return a;
	}
	ll e=exgcd(b,a%b,x,y);
	ll z=x;
	x=y;
	y=z-y*(a/b);
	return e;
}
pair<ll,ll> sogcd(ll a,ll b,ll c)
{
	if(c==0) return mp(0,0);
	ll e,op,x,y;
	if(a<0) c=-c,a=-a;
	e=exgcd(a,b,x,y);
	if(c%e!=0) return mp(0,0);
	ll k=c/e,ka=a/e,kb=b/e;
	ll nx=k*x,ny=k*y;
	ll qwq;
	if(nx<0) qwq=(kb-nx)/kb;
	else qwq=(1-nx)/kb;
	nx+=qwq*kb,ny-=qwq*ka;
	return mp(nx,ny);
}
int main()
{
	ll n=d,m=d;
	ll sum=0;
	for(int i=0;i<n;i++) (sum+=d)%=m;
	ll a=n*(n+1)/2,b=n;
	a%=m,b%=m;
	for(int i=0;i<m;i++)
	{
		auto x=sogcd(a,b,(i+m-sum)%m);
		if((x.fi*a%m+x.se*b%m+m)%m==(i+m-sum)%m)
		{
			printf("%lld\n",i);
			x.fi=(x.fi%m+m)%m;
			x.se=(x.se%m+m)%m;
			printf("%lld %lld\n",x.se,x.fi);
			return 0;
		}
	}
}