We are in the year, 2050 and AI has advanced to a whole new level. AI is planning to take over humans but needs to communicate with one another without human interception. To do so they decide to create a language of their own.
There are many levels of AI bots from level-1 to level-$$$n$$$.
The bots perform the following tasks:
Spidey being the savior he is, decides to learn this language to stop AI. How many words will he have to learn to stop them if $$$t$$$ $$$(1\le t \le 10^4)$$$ minutes have passed?
The only input line consists of three integers $$$n$$$ $$$(1\le n\le 100)$$$ — Highest level of the bots, $$$k$$$ $$$(1\le k \le 10^9)$$$ — Initial number of level-$$$n$$$ bots and $$$t$$$ $$$(1\le t \le 10^4)$$$ — Time passed.
Output a single integer — The number of words Spidey has to learn after $$$t$$$ minutes have passed. Since the answer can be huge, output it modulo $$$10^9 + 7$$$.
5 10 40
560
40 100 50
0
10 10 100
1847560
In testcase 1 we have level-5 bots.