CF GYM 100548 Color（2014ACM西安现场赛Problem F）

最新推荐文章于 2018-10-30 14:28:21 发布

wujy47

最新推荐文章于 2018-10-30 14:28:21 发布

阅读量3.2k

点赞数 1

分类专栏：组合数学-容斥原理 ACM 数论-整数快速幂文章标签： ACM2014 acm-icpc 西安2014

本文链接：https://blog.csdn.net/wujysh/article/details/43085255

版权

ProblemF. Color

Description

Recently, Mr. Bigrecieved n flowers from his fans. He wants to recolor those flowerswith m colors. The flowers are put in a line. It is not allowed tocolor any adjacent flowers with the same color. Flowers i and i + 1are said to be adjacent for every i, 1 ≤ i < n. Mr. Big alsowants the total number of different colors of the n flowers beingexactly k.

Two ways areconsidered different if and only if there is at least one flowerbeing colored

with differentcolors.

Input

The first line ofthe input gives the number of test cases, T. T test cases follow. Tis about 300 and in most cases k is relatively small.

For each test case,there will be one line, which contains three integers n, m, k (1 ≤n, m ≤ 10^9, 1 ≤ k ≤ 10^6, k ≤ n, m).

Output

For each test case,output one line containing “Case #x: y”, where x is the test casenumber (starting from 1) and y is the number of ways of differentcoloring methods modulo 10^9 + 7.

Samples