#include <bits/stdc++.h>
using namespace std;

using i32 = int;
using i64 = long long;
template <typename T>
using V = vector<T>;
template <typename T>
using VV = V<V<T>>;
template <typename T>
using VVV = V<VV<T>>;
template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

#define ALL(x) begin(x), end(x)
#define LEN(x) (i32) size(x)
#define OVERRIDE4(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)
#define REP3(i, l, r) for (i32 i = (i32)(l); i < (i32)(r); ++i)
#define REP(...) OVERRIDE4(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER2(i, n) for (i32 i = (i32)(n)-1; i >= 0; --i)
#define PER3(i, l, r) for (i32 i = (i32)(r)-1; i >= (i32)(l); --i)
#define PER(...) OVERRIDE4(__VA_ARGS__, PER3, PER2)(__VA_ARGS__)

void dbg(i32 x) { cerr << x; }
void dbg(i64 x) { cerr << x; }
template <typename T, typename U>
void dbg(pair<T, U> p) {
    cerr << '(';
    dbg(p.first);
    cerr << ", ";
    dbg(p.second);
    cerr << ')';
}
template <typename T>
void dbg(V<T> arr) {
    cerr << '[';
    REP(i, LEN(arr)) {
        if (i) {
            cerr << ", ";
        }
        dbg(arr[i]);
    }
    cerr << ']';
}
void debug() { cerr << '\n'; }
template <typename Head, typename... Tail>
void debug(Head head, Tail... tail) {
    dbg(head);
    cerr << ", ";
    debug(tail...);
}
#ifdef DEBUGF
#define DBG(...)                       \
    do {                               \
        cerr << #__VA_ARGS__ << " : "; \
        debug(__VA_ARGS__);            \
    } while (false)
#else
#define DBG(...) (void)0
#endif

constexpr unsigned MOD = 1000000007;

struct M {
    unsigned v;
    M() : v(0) {}
    M(unsigned x) : v(x % MOD) {}
    M &operator+=(M rhs) {
        v += rhs.v;
        if (v >= MOD) {
            v -= MOD;
        }
        return *this;
    }
    M &operator-=(M rhs) {
        v -= rhs.v;
        if (v >= MOD) {
            v += MOD;
        }
        return *this;
    }
    M &operator*=(M rhs) {
        v = ((unsigned long long)v * rhs.v) % MOD;
        return *this;
    }
    friend M operator+(M lhs, M rhs) {
        lhs += rhs;
        return lhs;
    }
    friend M operator-(M lhs, M rhs) {
        lhs -= rhs;
        return lhs;
    }
    friend M operator*(M lhs, M rhs) {
        lhs *= rhs;
        return lhs;
    }
    M pow(unsigned long long t) const {
        M self = *this;
        M ret(1);
        while (t) {
            if (t & 1) {
                ret *= self;
            }
            self *= self;
            t /= 2;
        }
        return ret;
    }
    M inv() const { return this->pow(MOD - 2); }
    M operator/=(M rhs) {
        *this *= rhs.inv();
        return *this;
    }
    friend M operator/(M lhs, M rhs) {
        lhs /= rhs;
        return lhs;
    }
};

M solve_k0(i32 n, i32 m, V<i32> par) {
    i32 s = max(n, m) + 1;
    V<M> fact(s), invfact(s);
    fact[0] = M(1);
    REP(i, s - 1) { fact[i + 1] = fact[i] * M(i + 1); }
    invfact[s - 1] = fact[s - 1].inv();
    PER(i, s - 1) { invfact[i] = invfact[i + 1] * M(i + 1); }

    V<M> tree(m + 1);
    REP(i, 1, m + 1) {
        V<M> f(i);
        REP(j, i) { f[j] = tree[j] * invfact[j]; }
        VV<M> pws(i, V<M>(i));
        pws[0][0] = M(1);
        REP(j, i - 1) REP(k, i) {
            REP(l, i) {
                if (k + l == i) {
                    break;
                }
                pws[j + 1][k + l] += pws[j][k] * f[l];
            }
        }
        V<M> tmp(i);
        REP(j, i) REP(k, i) {
            tmp[k] += pws[j][k] * invfact[j];
        }
        tree[i] += tmp[i - 1] * fact[i - 1];
        REP(j, 1, i) {
            REP(k, 1, j + 1) {
                tree[i] += tree[j] * tmp[i - 1 - j] * invfact[j - k] * fact[i - 1 - k];
            }
        }
    }
    REP(i, m + 1) {
        cerr << tree[i].v << " \n"[i == m];
    }
    M ans;
    {
        V<M> f(m + 1);
        REP(j, m + 1) { f[j] = tree[j] * invfact[j]; }
        VV<M> pws(m + 1, V<M>(m + 1));
        pws[0][0] = M(1);
        REP(j, m) REP(k, m + 1) {
            REP(l, m + 1) {
                if (k + l == m + 1) {
                    break;
                }
                pws[j + 1][k + l] += pws[j][k] * f[l];
            }
        }
        V<M> tmp(m + 1);
        REP(j, m + 1) REP(k, m + 1) {
            tmp[k] += pws[j][k] * invfact[j];
        }
        ans += tmp[m] * fact[m];
    }
    return ans;
}

void solve() {
    i32 n, m, k;
    cin >> n >> m >> k;
    V<i32> par(n, -1);
    REP(i, 1, n) {
        cin >> par[i];
        --par[i];
    }

    if (m == 0) {
        cout << 1 << '\n';
        return;
    }
    if (m == 1) {
        cout << 2 * n - 1 << '\n';
        return;
    }

    if (k == 0 && n == 1) {
        cout << solve_k0(n, m, par).v << '\n';
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    i32 testcase, t;
    cin >> testcase >> t;
    while (t--) {
        solve();
    }
}