#include <iostream>
#include <algorithm>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 3010, MAXM = 1050, mod = 1e9 + 7;

int n, m, k;

ll f[MAXN][MAXM];

int main()
{
    // freopen("B.in", "r", stdin);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    int CASE, T; Read(CASE), Read(T);
    while (T--)
    {
        Read(n), Read(m), Read(k);
        for (int i = 2, x; i <= n; i++) Read(x);
        for (int i = 0; i <= m; i++)
            for (int s = 0; s < (1 << k); s++)
                f[i][s] = 0;
        f[0][0] = 1;
        for (int i = 0, sz; i < m; i++)
            for (int s = 0; s < (1 << k); s++)
            {
                if (!f[i][s]) continue;
                sz = n + i + __builtin_popcount(s);
                if (!(s & 1) || !k)
                {
                    (f[i + 1][s >> 1] += f[i][s] * (2 * sz - 1)) %= mod;
                    if (k) (f[i + 1][s >> 1 | (1 << k - 1)] += f[i][s] * (sz - 1)) %= mod;
                    for (int j = 0; j < k; j++)
                        if (s & (1 << j)) (f[i + 1][(s ^ (1 << j)) >> 1] += f[i][s]) %= mod;
                }
                else (f[i + 1][s >> 1] += f[i][s]) %= mod;
            }
        cout << f[m][0] << '\n';
    }
    return 0;
}