题库练习 Partitions
← 上一题 下一题 →

A11717 | Partitions

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

题目描述

You are given a set of $n$ elements indexed from $1$ to $n$ . The weight of $i$ -th element is $w_{i}$ . The weight of some subset of a given set is denoted as ![](/uploads/luogu/CF961G/fbf0c843290b6183affbaf7ada0d6cecd6d2fbbd_6e98301013cf.png). The weight of some partition $R$ of a given set into $k$ subsets is ![](/uploads/acgo/image/e152b65404725cbf_ee6105856e20.jpeg) (recall that a partition of a given set is a set of its subsets such that every element of the given set belongs to exactly one subset in partition).

Calculate the sum of weights of all partitions of a given set into exactly $k$ non-empty subsets, and print it modulo $10^{9}+7$ . Two partitions are considered different iff there exist two elements $x$ and $y$ such that they belong to the same set in one of the partitions, and to different sets in another partition.

输入格式

The first line contains two integers $n$ and $k$ ( $1<=k<=n<=2·10^{5}$ ) — the number of elements and the number of subsets in each partition, respectively.

The second line contains $n$ integers $w_{i}$ ( $1<=w_{i}<=10^{9}$ )— weights of elements of the set.

输出格式

Print one integer — the sum of weights of all partitions of a given set into $k$ non-empty subsets, taken modulo $10^{9}+7$ .

输入输出样例

输入 #1
4 2
2 3 2 3
输出 #1
160
输入 #2
5 2
1 2 3 4 5
输出 #2
645
C++ 编辑器
输入
输出