#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

int partition(int m, int k, int** dyn, vector<int> setA) {
	
	while (!setA.empty() && k == setA.back()) {
		k--;
		setA.pop_back();
	}

	if (dyn[m][k] != -1) return dyn[m][k];
	else if (m == 0) return 1;
	else if (k == 0) return 0;
	else {
		int sum = 0;
		int num_iter = m / k;
		for (int j = 0; j <= num_iter; j++) {
			int new_m = m - j * k;
			int new_k = min(new_m, k - 1);
			sum = sum % int(pow(10, 9) + 7) + partition(new_m, new_k, dyn, setA)%int(pow(10,9)+7);
			sum = sum % int((pow(10, 9) + 7));
		}
		dyn[m][k] = sum;
		return sum;
	}
}

int main() {
	int N,m,size_A ;
	cin >> N; //get number of test cases
	for (int i = 0; i < N; i++) {
		cin >> size_A >> m; //get size of setA and m
		vector<int> setA(size_A);
		for (int j = 0; j < size_A; j++) {
			cin >> setA[j];
		}
		sort(setA.begin(), setA.end()); //sort setA in ascending order
		//2D array for dynamic programming
		int** dyn = new int* [m + 1];
		for (int j = 0; j < m + 1; j++) {
			dyn[j] = new int[m + 1];
		}
		for (int j = 0; j < m + 1; j++) {
			for (int k = 0; k < m + 1; k++) {
				dyn[j][k] = -1;
			}
		}
		cout << partition(m, m, dyn, setA) << "\n";
	}
	
}