CF891E.Lust

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

A false witness that speaketh lies!

You are given a sequence containing nn integers. There is a variable resres that is equal to 00 initially. The following process repeats kk times.

Choose an index from 11 to nn uniformly at random. Name it xx . Add to resres the multiply of all aia_{i} 's such that 1<=i<=n1<=i<=n , but ixi≠x . Then, subtract axa_{x} by 11 .

You have to find expected value of resres at the end of the process. It can be proved that the expected value of resres can be represented as an irreducible fraction . You have to find .

输入格式

The first line contains two integers nn and kk ( 1<=n<=50001<=n<=5000 , 1<=k<=1091<=k<=10^{9} ) — the number of elements and parameter kk that is specified in the statement.

The second line contains nn space separated integers a1,a2,...,ana_{1},a_{2},...,a_{n} ( 0<=ai<=1090<=a_{i}<=10^{9} ).

输出格式

Output a single integer — the value .

输入输出样例

  • 输入#1

    2 1
    5 5
    

    输出#1

    5
  • 输入#2

    1 10
    80
    

    输出#2

    10
  • 输入#3

    2 2
    0 0
    

    输出#3

    500000003
  • 输入#4

    9 4
    0 11 12 9 20 7 8 18 2
    

    输出#4

    169316356
首页