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

#define ll long long

ll T, n, aim, a[101000], b[101000];

ll gao(){
    ll x=0;
    for (int c=1;c<=3;++c){
        for (int i=1;i<=n;++i){
            x=max(0ll,x+a[i]);
            if (x>=aim) return c;
        }
    }
    if (b[n]<=0) return -1;
    ll mx=*max_element(b+1,b+n+1);
    if (mx+x>=aim) return 4;
    return (aim-mx-x+b[n]-1)/b[n]+4;
}

int main(){
    for (cin>>T;T--;){
        cin>>n>>aim;
        for (int i=1;i<=n;++i){
            scanf("%lld",&a[i]);
            b[i]=a[i]+b[i-1];
        }
        cout<<gao()<<endl;
    }
}