Consider nn initial strings of lower case letters, where no initial string is a prefix of any other initial string. Now, consider choosing kk of the strings (no string more than once), and concatenating them together. You can make this many such composite strings:

\displaystyle n \times (n - 1) \times (n - 2) \times . . . \times (n - k + 1)n×(n−1)×(n−2)×...×(n−k+1)

Consider sorting all of the composite strings you can get via this process in alphabetical order. You are given a test composite string, which is guaranteed to belong on this list. Find the position of this test composite string in the alphabetized list of all composite strings, modulo 10^9 + 7109+7. The first composite string in the list is at position 11.

Input Format

Each input will consist of a single test case.

Note that your program may be run multiple times on different inputs.

Each test case will begin with a line with two integers, first nn and then k (1 \le k \le n)k(1≤k≤n), where nn is the number of initial strings, and kk is the number of initial strings you choose to form composite strings. The upper bounds of nnand kk are limited by the constraints on the strings, in the following paragraphs.

Each of the next nn lines will contain a string, which will consist of one or more lower case letters a..za..z. These are the nn initial strings. It is guaranteed that none of the initial strings will be a prefix of any other of the initial strings.

Finally, the last line will contain another string, consisting of only lower case letters a..za..z. This is the test composite string, the position of which in the sorted list you must find. This test composite string is guaranteed to be a concatenation of kk unique initial strings.

The sum of the lengths of all input strings, including the test string, will not exceed 10^6106 letters.

Output Format

Output a single integer, which is the position in the list of sorted composite strings where the test composite string occurs. Output this number modulo 10^9 + 7109+7.

 #include <iostream>

 #include <cstdio>

 #include <algorithm>

 #include <cstdlib>

 #include <cstring>

 #include <string>

 #include <deque>

 using namespace std;

 #define ll long long

 #define  N 1000009

 #define  gep(i,a,b)  for(int  i=a;i<=b;i++)

 #define  gepp(i,a,b) for(int  i=a;i>=b;i--)

 #define  gep1(i,a,b)  for(ll i=a;i<=b;i++)

 #define  gepp1(i,a,b) for(ll i=a;i>=b;i--)

 #define  mem(a,b)  memset(a,b,sizeof(a))

 #define  mod  1000000007

 #define  lowbit(x)  x&(-x)

 ll n,m;

 ll pos,dfn;

 ll tree[N][],c[N],a[N];

 char s[N];

 ll vis[N];

 ll fac[N] = {, }, inv[N] = {, }, f[N] = {, };

 void init(){

     gep(i,,N){

         fac[i]=fac[i-]*i%mod;

         f[i]=(mod-mod/i)*f[mod%i]%mod;

         inv[i]=inv[i-]*f[i]%mod;

     }

 }

 ll A(ll n,ll m){

     if(n<m) return ;

     return   fac[n]*inv[n-m]%mod;//一开始*写成了%

 }

 void update(ll i,ll num){

     while(i<=n){

         c[i]+=num;

         i+=lowbit(i);

     }

 }

 ll getsum(ll i){

     ll sum=;

     while(i>){

         sum+=c[i];

         i-=lowbit(i);

     }

     return sum;

 }

 void dfs(int u){

     if(vis[u])  vis[u]=++dfn;//排序

     gep(i,,){

         if(tree[u][i]) dfs(tree[u][i]);

     }

 }

 int main()

 {

     init();

     scanf("%lld%lld",&n,&m);

     pos=;

     gep1(i,,n){

         scanf("%s",s);

         ll l=strlen(s)-;

         ll x=;

         //建字典树

         gep1(j,,l){

             if(!tree[x][s[j]-'a'])  tree[x][s[j]-'a']=++pos;

             x=tree[x][s[j]-'a'];

         }

         vis[x]=;//只标记最后的元素

     }

     dfn=;

     dfs();

     scanf("%s",s);

     ll l=strlen(s)-;

     ll x=,cnt=;

     gep1(i,,l){

         x=tree[x][s[i]-'a'];

         if(vis[x]) a[++cnt]=vis[x],x=;//找到每个的标记，每次还要x==0

     }

     gep1(i,,n)  update(i,);

     ll ans=;

     gep1(i,,cnt){

         update(a[i],-);

         ll ans1=getsum(a[i]);//前面还可以再用的

         ll ans2=A(n-i,m-i);

         ans=(ans+ans1*ans2%mod)%mod;

     }

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

     return ;

 }