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


const int N = 1e5+79;
const int X = 1e3+79;

long long dp[N][X];
int n,x,z;
vector<int>a;




signed main() {
 ios::sync_with_stdio(0);
 cin.tie(0);
 cout.tie(0);
 int tt;
 cin >> tt;
 while(tt--) {
  cin >> n >> x >> z;
  for(int i = 0 ; i <= n+2; i++) {
    for(int j = 0 ; j <= x+2 ; j++) {
        dp[i][j] = 1e18;
    }
  }
  a.resize(n);
  for(int i = 0 ; i < n ; i++) {
    cin >> a[i];
  }
  if(z%x == 0) {
    cout << z/x << '\n';
    continue;
  }
  dp[0][a[0]%x] = a[0];
  for(int i = 0 ; i < n ; i++) {
    dp[i][a[i]%x] = min(dp[i][a[i]%x],a[i]);
    for(int j = 0 ; j <= x ; j++) {


        // choose this index
        int y = (j + a[i]) % x;
        dp[i+1][y] = min(dp[i+1][y],dp[i][j] + a[i]);

        // dont choose this index
        dp[i+1][j] = min(dp[i+1][j],dp[i][j]);
    }
  } 
  int need = z%x;
  int fromAbove = x - need;
  if(dp[n][fromAbove] == 1e18) {
    cout << "-1\n";
  } else {
    long long want = (dp[n][fromAbove] + z + x - 1)/x;
    cout << want << '\n';
  }
 }
}