这个号码不知道什么用，还是放这里吧：651405140

宏定义会毒害人

#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define drep(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define pb(x) push_back(x)
#define mp(x, y) (make_pair(x, y))
#define xx first
#define yy second
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
const int inf = ~0U >> 1;
const ll INF = ~0ULL >> 1;
//***************************

class SimilarSequences
{
	public:
		
	set<vector<int> > S;
	int N, h[100], n, p[100];
	int count(vector <int> seq, int bound)
	{
		S.clear();
		n = 0;
		N = seq.size();
		REP(i, 0, N) h[++n] = seq[i];
		sort(h + 1, h + n + 1);
		n = unique(h + 1, h + n + 1) - h - 1;
		REP(i, 0, N) seq[i] = lower_bound(h + 1, h + n + 1, seq[i]) - h;
		REP(i, 0, N) 
			REP(j, 0, N) 
			{
				int tmp = 0;
				REP(k, 0, N) if (k != i) p[tmp++] = seq[k];
				tmp = 0;
				vector<int> buf; buf.clear();
				REP(k, 0, N) 
					if (k != j) buf.pb(p[tmp++]);
					else buf.pb(0);
				rep(b, 1, n)
				{
					buf[j] = b;
					S.insert(buf);
				}
				buf[j] = -1;
				S.insert(buf);
			}
		int ans = 0;
		for (vector<int> T:S)
		{
			int t = 1;
			for (auto i:T) 
			{
				if (i == -1) t = bound - n;
			}
			ans += t; ans %= 100000007;
		} 
		return (int)ans;
 	}

} 

test;

int main()
{
	int N, bound, x;
	while (scanf("%d%d", &N, &bound) != EOF)
	{
		vector<int> seq; seq.clear();
		REP(i, 0, N) scanf("%d", &x), seq.pb(x);
		printf("%d\n", test.count(seq, bound));
	}
 	return 0;
}