# include <bits/stdc++.h> using namespace std ; struct nde { double begin , end ; } nde node [10005] ; bool cmp ( nde a , nde b ) { return a . begin != b . begin ? a . begin < b . begin :a . end < b . end ; } int main ( ) { int n , m , w , h ; cin >> m ; while ( m -- ) { cin >> n >> w >> h ; int k = 0 , ans = 0 ; for ( int j = 1 ; j <= n ; j ++ ) { cin >> dot [j] ; } sort ( dot + 1 , dot + n + 1 , greater <double> ( ) ) ; double len = 0 , len1 = 0 ; for ( int j = 1 ; j <= n ; j ++ ) { len += 2 * sqrt ( dot [j] * dot [j] - 1 ) ; len1 += 2 * sqrt ( dot [j] * dot [j] - 1 ) ; if ( len >= h && len1 >= w ) { cout << j << endl ; break ; } } } return 0 ; }