题库练习 Team Work
← 上一题 下一题 →

A11630 | Team Work

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

You have a team of $N$ people. For a particular task, you can pick any non-empty subset of people. The cost of having $x$ people for the task is $x^{k}$ .

Output the sum of costs over all non-empty subsets of people.

输入格式

Only line of input contains two integers $N$ $(1<=N<=10^{9})$ representing total number of people and $k$ $(1<=k<=5000)$ .

输出格式

Output the sum of costs for all non empty subsets modulo $10^{9}+7$ .

输入输出样例

输入 #1
1 1
输出 #1
1
输入 #2
3 2
输出 #2
24
C++ 编辑器
输入
输出