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
#include "bits/stdc++.h"
using namespace std;

#define rep(i, b, e) for(int i = (b); i <= (e); i++)
#define per(i, b, e) for(int i = (e); i >= (b); i--)
#define FOR(i, b, e) rep(i, b, (e) - 1)
#define SZ(x) int(x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;

auto &operator<<(auto &o, pair<auto, auto> p) {
    return o << "(" << p.st << ", " << p.nd << ")"; }
auto operator<<(auto &o, auto x)->decltype(end(x), o) {
    o << "{"; int i=0; for(auto e: x) o << ", " + 2*!i++ << e;
    return o << "}"; }
#ifdef LOCAL
#define deb(x...) cerr << "[" #x "]: ", [](auto...$) { \
    ((cerr << $ << "; "),...) << endl; }(x)
#else
#define deb(...)
#endif

int mod;

int pov(int base, int exp = mod - 2) {
    int res = 1;
    for(; exp; exp >>= 1) {
        if(exp & 1) res = ll(res) * base % mod;
        base = ll(base) * base % mod;
    }
    return res;
}

void solve() {
    int a, b, c;
    cin >> a >> b >> c >> mod;
    int sz = 0, hook = 1;
    FOR(i, 0, a) FOR(j, 0, b) {
        int me = i + j;
        if(me >= c) continue;
        sz++;
        int r = min(b - j, c - me);
        int d = min(a - i, c - me);
        int h = r + d - 1;
        hook = ll(hook) * h % mod;
    }
    int ans = 1;
    FOR(i, 0, sz) ans = ll(i + 1) * ans % mod;
    ans = ll(ans) * pov(hook) % mod;
    ans = ll(ans) * ans % mod;
    cout << sz << ' ' << ans << '\n';
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int tt = 1;
    // cin >> tt;
    FOR(te, 0, tt) solve();
    return 0;
}