1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<algorithm>
#include<bits/stdc++.h>
#define pr pair
#define f first
#define s second
#define ll long long
#define mp make_pair
#define pll pr<ll,ll>
#define pii pr<int,int>
#define piii pr<int,pii>
using namespace std;
ll m;
ll jc[1000006];
ll jy[1000006];
ll iv[1000006];
ll pw(ll a,ll b=m-2)
{
	ll r=1;
	while(b)
	{
		if(b&1) r=r*a%m;
		a=a*a%m;
		b>>=1;
	}
	return r;
}
int main()
{
	int a,b,c;
	cin>>a>>b>>c>>m;
	jc[0]=1;
	for(int i=1;i<=1000000;i++) jc[i]=jc[i-1]*i%m;
	jy[1000000]=pw(jc[1000000]);
	for(int i=999999;i>=0;i--) jy[i]=jy[i+1]*(i+1)%m;
	for(int i=1;i<=1000000;i++) iv[i]=jy[i]*jc[i-1]%m;
	ios_base::sync_with_stdio(0);
	cout<<a*b<<' ';
	ll op=jc[a*b];
	for(int i=0;i<a;i++) for(int j=0;j<b;j++) op=op*iv[i+j+1]%m;
	cout<<op*op%m<<endl;
	return 0;
}