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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include <bits/stdc++.h>
#define FOR(i,p,k) for(int i=(p);i<=(k);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define RFOR(i,p,n) for(int i=(p);i>=(n);--i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define ssize(x) int((x).size())
#define fi first
#define se second
#define V vector
#define pb push_back
#define eb emplace_back
#define C const
#define pn printf("\n")
using namespace std;
typedef long long ll;
typedef V<int> vi;
typedef V<ll> vll;
typedef const int ci;
typedef const ll cll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
void chmin(auto &a, auto b){a=min(a,b);}
void chmax(auto &a, auto b){a=max(a,b);}
ci inf = 2.1e9;
cll infll = 4.5e18;

int I(){
    int z;
    scanf("%d", &z);
    //cin >> z;
    return z;
}

int mod;
int add(int a, int b){
    return a+b < mod ? a+b : a+b-mod;
}
int mul(int a, int b){
    return int(ll(a)*b%mod);
}
int pot(int a, int b = mod-2){
    int ret = 1;
    for(; b; b /= 2, a = mul(a, a)) if(b&1) ret = mul(ret, a);
    return ret;
}

void answer(){
    int a = I(), b = I(), c = I();
    mod = I();
    if(c == a+b-1){
        int n = a*b;
        int wyn = 1;
        REP(i, a) REP(j, b) wyn = mul(wyn, i+j+1);

        int silnia = 1;
        FOR(i, 1, n) silnia = mul(silnia, i);
        wyn = mul(silnia, pot(wyn));

        wyn = mul(wyn, wyn);
        printf("%d %d\n", n, wyn);
        return;
    }

    int n = a*b;
    int mniej = a+b-1-c;
    n -= mniej*(mniej+1)/2;

    int wyn = 0;
    vi perm(n);
    REP(i, n) perm[i] = i;
    do{
        vi rosnacy(n, 1);
        REP(i, n) REP(j, i) if(perm[j] < perm[i]) chmax(rosnacy[i], rosnacy[j]+1);
        vi malejacy(n, 1);
        RFOR(i, n-1, 0) FOR(j, i+1, n-1) if(perm[j] < perm[i]) chmax(malejacy[i], malejacy[j]+1);
        int lis = 0;
        REP(i, n) chmax(lis, rosnacy[i]);
        int dis = 0;
        REP(i, n) chmax(dis, malejacy[i]);
        int lids = 0;
        REP(i, n) chmax(lids, rosnacy[i]+malejacy[i]-1);
        if(lis == a && dis == b && lids == c) ++wyn;
    } while(next_permutation(all(perm)));
    printf("%d %d\n", n, wyn);
}

int main(){
    //ios_base::sync_with_stdio(0);
    //cin.tie(0);
    int tt = 1;
    //tt = I();
    while(tt--) answer();
}