King's Colors Gym - 101933K

 https://vjudge.net/problem/Gym-101933K

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e5+9;
const int mod=1e9+7;

ll f[maxn+100];
ll inv[maxn+100];

ll ksm(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x%mod;
        x=x*x%mod;
        n>>=1;
    }
    return ans;
}

void F()
{
    f[0]=1;
    for(int i=1;i<=maxn;i++) f[i]=f[i-1]*i%mod;
}

void Inv_fac()
{
    inv[maxn]=ksm(f[maxn],mod-2)%mod;
    for(int i=maxn-1;i>=0;i--)
    {
        inv[i]=(inv[i+1]*(i+1))%mod;
    }
}

ll C(ll n,ll m)
{
    if(n<0||m<0||m>n) return 0;
    return ((f[n]*inv[m])%mod*inv[n-m])%mod;
}

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    F();
    Inv_fac();

    ll n,k;
    while(~scanf("%I64d%I64d",&n,&k))
    {
        ll ans=0;
        for(int i=0;i<n-1;i++)
        {
            int v;
            sfi(v);
        }

        int flag=1;

        for(int i=0;i<k;i++)
        {
            ans=(ans+flag*(k-i)%mod*C(k,i)%mod*ksm(k-i-1,n-1)%mod+mod)%mod;
            flag=-flag;
        }

        printf("%I64d\n",ans);


    }


    return 0;
}