#include <iostream>
#include<queue>
using namespace std;
int main() {
// your code goes here
int t;
cin >> t;
while(t--){
int n,i;
long int a,b,x,y,z;
cin>>n>>a>>b>>x>>y>>z;
priority_queue<long int> c;
long int q;
for(i =0; i<n;i++){
cin>>q;
c.push(q);
}
long int prem = (z-a)%x;
long int hday = (z-b)/y;
if((z-b)%y != 0)
hday++;
prem = z - (a+((hday-1)*x));
// printf("%ld\n",prem);
int flg = 0,cnt = 0;
while(prem > 0 && c.size() > 0){
q = c.top();
c.pop();
//printf("%ld\n",q);
prem -= q;
cnt++;
long int tmp = q >> 1;
if(tmp > 0)
c.push(tmp);
}
if(prem > 0){
printf("RIP\n");
}
else
printf("%d\n",cnt);
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxxdWV1ZT4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJaW50IHQ7CgljaW4gPj4gdDsKCXdoaWxlKHQtLSl7CgkJaW50IG4saTsKCQlsb25nIGludCBhLGIseCx5LHo7CgkJY2luPj5uPj5hPj5iPj54Pj55Pj56OwoJCXByaW9yaXR5X3F1ZXVlPGxvbmcgaW50PiBjOwoJCWxvbmcgaW50IHE7CgkJZm9yKGkgPTA7IGk8bjtpKyspewoJCQljaW4+PnE7CgkJCWMucHVzaChxKTsKCQl9CgkJbG9uZyBpbnQgcHJlbSA9ICh6LWEpJXg7CgkJbG9uZyBpbnQgaGRheSA9ICh6LWIpL3k7CgkJaWYoKHotYikleSAhPSAwKQoJCQloZGF5Kys7CgkJcHJlbSA9IHogLSAoYSsoKGhkYXktMSkqeCkpOwoJLy8JcHJpbnRmKCIlbGRcbiIscHJlbSk7CgkJaW50IGZsZyA9IDAsY250ID0gMDsKCQl3aGlsZShwcmVtID4gMCAmJiBjLnNpemUoKSA+IDApewoJCQlxID0gYy50b3AoKTsKCQkJYy5wb3AoKTsKCQkJLy9wcmludGYoIiVsZFxuIixxKTsKCQkJcHJlbSAtPSBxOwoJCQljbnQrKzsKCQkJbG9uZyBpbnQgdG1wID0gcSA+PiAxOwoJCQlpZih0bXAgPiAwKQoJCQkJYy5wdXNoKHRtcCk7CgkJfQoJCWlmKHByZW0gPiAwKXsKCQkJcHJpbnRmKCJSSVBcbiIpOwoJCX0KCQllbHNlCgkJCXByaW50ZigiJWRcbiIsY250KTsKCX0KCXJldHVybiAwOwp9