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
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
#include <algorithm>
#include <bitset>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>

using namespace std;

#define PB push_back
#define MP make_pair
#define F first
#define S second
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) (int)(x).size()
#define CLEAR(tab) memset(tab, 0, sizeof(tab))
#define REP(x, n) for(int x = 0; x < (n); x++)
#define FOR(x, b, e) for(int x = (b); x <= (e); x++)
#define FORD(x, b, e) for(int x = (b); x >= (e); x--)
#define VAR(v, n) __typeof(n) v = (n)
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define DEBUG(fmt, ...) fprintf(stderr, fmt, ##__VA_ARGS__)

typedef long long int LL;
typedef pair<int,int> PII;
typedef vector<int> VI;

const int MXN = 2000100;
const int C = 262144;
const int INF = 1000000001;
const int MOD = 1000000007;

int a, b, c, p;
LL fac[MXN];

LL pot(LL a, LL n) {
    LL res = 1;
    a %= p;
    while(n) {
        if(n & 1)
            res = (res * a) % p;
        a = (a * a) % p;
        n /= 2;
    }
    return res;
}

void wzorek() {
    int n = a * b;
    LL facn = 1;
    FOR(i, 2, n)
        facn = (facn * i) % p;

    LL w = 1;
    FOR(i, 1, a)
        FOR(j, 1, b) {
            LL tmp = (a - i) + (b - j) + 1;
            w = (w * tmp) % p;
        }
    LL w_inw = pot(w, p - 2);
    LL res = (facn * w_inw) % p;
    res = (res * res) % p;
    printf("%d %lld", n, res);
}

VI LIS(VI vec) {
    int n = SIZE(vec);
    VI res(n, 1);
    FOR(i, 0, n - 1)
        FOR(j, 0, i - 1)
            if(vec[j] < vec[i])
                res[i] = max(res[i], res[j] + 1);
    return res;
}

bool check(VI vec) {
    int n = SIZE(vec);
    VI lis = LIS(vec);
    reverse(ALL(vec));
    VI lds = LIS(vec);
    reverse(ALL(lds));
    int bit = 0;
    int lis_best = 0;
    int lds_best = 0;
    FOR(i, 0, n - 1) {
        lis_best = max(lis_best, lis[i]);
        lds_best = max(lds_best, lds[i]);
        bit = max(bit, lis[i] + lds[i] - 1);
    }

    return lis_best == a && lds_best == b && bit == c;
}

void brucik() {
    int mx = a * b;
    int res = 0, cnt = 0;
    FOR(o, 1, mx) {
        VI vec;
        int tmpCnt = 0;
        FOR(i, 1, o)
            vec.PB(i);
        do {
            if(check(vec))
                tmpCnt++;
        } while(next_permutation(vec.begin(), vec.end()));
        if(tmpCnt) {
            res = o;
            cnt = tmpCnt;
        }
    }
    printf("%d %d\n", res, cnt);
}

void test() {
    scanf("%d %d %d %d", &a, &b, &c, &p);
    if(c == a + b - 1)
        wzorek();
    else
        brucik();
}

int main() {
	int te = 1;
	//scanf("%d", &te);
	while(te--)
		test();
	return 0;
}