#include <cstdio>#include <iostream>#include <sstream>#include <cstdlib>#include <string>#include <vector>#include <set>#include <queue>#include <stack>#include <list>#include <cmath>#include <algorithm>#include <map>#include <ctype.h>#include <string.h>using namespace std;typedef long long LL;typedef pair<int, int> PII;typedef pair<PII, int> PII2;int v[10005];int N, T, L;int main(){ int test; cin >> test; for(int tt = 0; tt < test; tt++ ){ cin >> N >> T >> L; for(int i = 0; i < N; i++ ) cin >> v[i]; sort(v, v + N, greater<int>()); int good = 0; for(int i = 0; i < N; ++i){ if(L <= v[i] * T){ printf("%.2lfn", T * i + 1.0 * L / v[i]); good = 1; break; } else { L -= v[i] * T; } } if(!good) printf("-1n"); } return 0;}
