时间限制：C/C++/Rust/Pascal 3秒，其他语言6秒
空间限制：C/C++/Rust/Pascal 1024 M，其他语言2048 M
Special Judge, 64bit IO Format: %lld
空间限制：C/C++/Rust/Pascal 1024 M，其他语言2048 M
Special Judge, 64bit IO Format: %lld
题目描述
Find the number of labeled trees that satisfy the following conditions:
1.
vertices.
2. Each vertex has a degree less than or equal to
.
3. There exists a path that includes nodes
. Note that this path may also include other nodes.
Output the result modulo
.
1.
2. Each vertex has a degree less than or equal to
3. There exists a path that includes nodes
Output the result modulo
输入描述:
The first line contains three positive integers.
输出描述:
Output one integer, which is the answer modulo.
备注:
.