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
#include
using
#define
#define
#define
#define
typedef
typedef
const
//head
const
int
const
ll cur,p[maxn],q[maxn],inv[maxn];
ll n,m;
ll C
return
}
ll c
if
if
return
}
void
p[0
for
inv[i] = (mod-mod/i)*inv[mod%i]%mod;
q[i] = q[i-1
p[i] = p[i-1
}
}
int
#ifdef
freopen("j.in"
#endif
init();
scanf
rep(test_case,1
scanf
ll len = min(n,m);
ll ans = 0
cur = 1
for
ans = (ans + (c(m,i)*p[i]%mod)*c(n-1
}
printf
}
return
}