WC也会有这种不怎么难的数学题吗。。(?)
先考虑二维的情况。
枚举初始点,然后枚举初始点到最后一个点的两坐标的距离,就可以知道答案是
∑x=1m1∑y=1m2∑i=1m1−x∑j=1m2−y(gcd(x,y)−1c−2)
稍微化简一下并用 ∑d[d=gcd(x,y)] 和 ∑p∣dμ(p)=[d=1] 代入可得
∑d(d−1c−2)∑p∑i=1⌊m1−1dp⌋∑j=1⌊m2−1dp⌋(m1−dpi)(m2−dpj)
如果我们设 Pi(x)=(2mi−x−x⌊mi−1x⌋)⌊mi−1x⌋/2 并稍微再调换一下上式的求和顺序,可得
∑p(∏i=1nPi(p))∑d∣p(d−1c−2)μ(pd)
同理,放到 n 维下的答案就是这个玩意。
设
但是这样还不够,我们会发现前面那个多项式乘积里面带整除符号的系数有点难搞,于是暴力把多项式乘出来,得到 F(x)=∑ni=1Pi(x) 的 F(x) 的各项系数, 于是对于每段相同的 ⌊m−1x⌋ 多项式都有相同的系数,然后就可以区间和算出来了,所以我们不搞 gp,c 了,而是预处理 gp,c,k=∑d∣p(d−1c−2)μ(pd)pk ,这样就可以愉快地分块算了。
每个 mi 会贡献 O(m−−√) 段,因此总共有 O(nm−−√) 段。而每次计算多项式系数的时候因为都是一次多项式相乘,所以直接 O(n2) 暴力即可。于是总复杂度为 O(mm−−√+mcm−−√/logm+mcn+Tn3m−−√) 。。。。其中 O(mm−−√/logm) 是不大于 m 的所有数的因数总数贡献的。。。
吐槽一句。。。
【丑的一比的代码】
/*
I will chase the meteor for you, a thousand times over.
Please wait for me, until I fade forever.
Just 'coz GEOTCBRL.
*/
#include <bits/stdc++.h>
using namespace std;
#define fore(i,u) for (int i = head[u] ; i ; i = nxt[i])
#define rep(i,a,b) for (int i = a , _ = b ; i <= _ ; i ++)
#define per(i,a,b) for (int i = a , _ = b ; i >= _ ; i --)
#define For(i,a,b) for (int i = a , _ = b ; i < _ ; i ++)
#define Dwn(i,a,b) for (int i = ((int) a) - 1 , _ = (b) ; i >= _ ; i --)
#define fors(s0,s) for (int s0 = (s) , _S = s ; s0 ; s0 = (s0 - 1) & _S)
#define foreach(it,s) for (__typeof(s.begin()) it = s.begin(); it != s.end(); it ++)
#define mp make_pair
#define pb push_back
#define pii pair<int , int>
#define fir first
#define sec second
#define MS(x,a) memset(x , (a) , sizeof (x))
#define gprintf(...) fprintf(stderr , __VA_ARGS__)
#define gout(x) std::cerr << #x << "=" << x << std::endl
#define gout1(a,i) std::cerr << #a << '[' << i << "]=" << a[i] << std::endl
#define gout2(a,i,j) std::cerr << #a << '[' << i << "][" << j << "]=" << a[i][j] << std::endl
#define garr(a,l,r,tp) rep (__it , l , r) gprintf(tp"%c" , a[__it] , " \n"[__it == _])
template <class T> inline void upmax(T&a , T b) { if (a < b) a = b ; }
template <class T> inline void upmin(T&a , T b) { if (a > b) a = b ; }
typedef long long ll;
const int N = 100000;
const int maxn = 100007;
const int maxm = 200007;
const int mod = 10007;
const int inf = 0x7fffffff;
const double eps = 1e-7;
typedef int arr[maxn];
typedef int adj[maxm];
inline int fcmp(double a , double b) {
if (fabs(a - b) <= eps) return 0;
if (a < b - eps) return -1;
return 1;
}
inline int add(int a , int b) { return (a + b) % mod ; }
inline int mul(int a , int b) { return (a * b) % mod ; }
inline int dec(int a , int b) { return add(a , mod - b) ; }
inline int Pow(int a , int b) {
int t = 1;
while (b) {
if (b & 1) t = mul(t , a);
a = mul(a , a) , b >>= 1;
}
return t;
}
#define gc getchar
#define idg isdigit
#define rd RD<int>
#define rdll RD<long long>
template <typename Type>
inline Type RD() {
char c = getchar(); Type x = 0 , flag = 1;
while (!idg(c) && c != '-') c = getchar();
if (c == '-') flag = -1; else x = c - '0';
while (idg(c = gc()))x = x * 10 + c - '0';
return x * flag;
}
inline char rdch() {
char c = gc();
while (!isalpha(c)) c = gc();
return c;
}
#undef idg
#undef gc
// beginning
arr miu , pr , vis;
int g[maxn][19] , C[maxn][19] , tot;
int s[20][12][maxn] , F[20];
inline void get(int p , int d) {
if (!miu[p / d]) return;
int flag = miu[p / d] > 0;
rep (c , 0 , 18)
if (flag)
g[p][c] = add(g[p][c] , C[d - 1][c]);
else
g[p][c] = dec(g[p][c] , C[d - 1][c]);
}
inline void init() {
rep (i , 0 , N) {
C[i][0] = 1;
rep (j , 1 , min(i , 18)) C[i][j] = add(C[i - 1][j - 1] , C[i - 1][j]);
}
miu[1] = 1;
g[1][0] = 1;
rep (i , 0 , 11) s[0][i][1] = 1;
rep (i , 2 , N) {
if (!vis[i])
pr[++ tot] = i , miu[i] = -1;
rep (j , 1 , tot) if (i * pr[j] > N) break; else {
vis[i * pr[j]] = 1;
if (i % pr[j] == 0) break;
miu[i * pr[j]] = -miu[i];
}
for (int j = 1; j * j <= i; j ++) if (i % j == 0) {
get(i , j);
if (j * j != i) get(i , i / j);
}
rep (c , 0 , 18) {
int pw = 1;
rep (j , 0 , 11)
s[c][j][i] = add(s[c][j][i - 1] , mul(g[i][c] , pw)) , pw = mul(pw , i);
}
}
}
int n , c , mn;
int m[13];
void input() {
n = rd() , c = rd() , mn = maxn;
rep (i , 1 , n) m[i] = rd() , upmin(mn , m[i]);
}
inline void Mul(int n , int f0 , int f1) {
F[n] = 0;
per (i , n , 1) F[i] = add(mul(F[i] , f0) , mul(F[i - 1] , f1));
F[0] = mul(F[0] , f0);
}
void solve() {
static int inv2 = Pow(2 , mod - 2);
int ans = 0;
for (int l = 1 , r = 0; r < mn - 1; l = r + 1) {
r = inf;
rep (i , 1 , n) upmin(r , (m[i] - 1) / ((m[i] - 1) / l));
rep (i , 1 , n) F[i] = 0; F[0] = 1;
rep (i , 1 , n)
Mul(i , add(m[i] , m[i]) , mod - add((m[i] - 1) / l , 1));
int tmp = 0;
rep (i , 0 , n) tmp = add(tmp , mul(F[i] , dec(s[c - 2][i][r] , s[c - 2][i][l - 1])));
rep (i , 1 , n) tmp = mul(tmp , (m[i] - 1) / l);
ans = add(ans , tmp);
}
ans = mul(ans , Pow(inv2 , n));
printf("%d\n" , ans);
}
int main() {
#ifndef ONLINE_JUDGE
freopen("data.txt" , "r" , stdin);
#endif
init();
rep (T , 1 , rd()) {
input();
solve();
}
return 0;
}