func_code_string: /*   ``````````````````$$$$$   `````````````$$$$$$´´´´$$$$$$   ``````````$$$´´´´´´´´´´´´´´´´$$$   ````````$`$$´´´´´´´´´´´´´´´´´´´´$$   ```````$´$$$´´´´´´´´´´´´´´´´´´´´´$$$$   `````$´´$$$$´´´´´´´´´´´´´´´´´´´´´´´´´´$   ````$´´$$$$$´´´´´´´´´´$$$$$$$´´´´´´´´´$$   ```$´´´$$$$$$$´´´$$$$$$$$$$$$$$$$$´´´´´$$   ``$´´´´$$$$$$$$$$$$$$$$$$$$$$$$$$$$$´´´´$$   `$´´´´´´$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$´´$   `$´´´´´´$$$$$$$$$$$´´´´$$$$$$$$$$$$$$$$$$$   $´´´´´´´´$$$$$$$$´´´´´´´´$$$$$$$´´´´´´´´$$   $´´´´´´´´´$$$$$$´´´´´´´´´´$$$$´´´´´´´´´´´$   `$´´´´´´´´´$$$$$´´´´´´´´´´$$$´´´´´´´´´´´$   `$´´´´´´´´´´$$$$$´´´´´´´´$$$$´´´´´´´´´´´$   `$´´´´´´´´´´´$$$$$$´´´´$$$$$´´´´´´´´´´´$$   ``$´´´´´´´´´´´$$$$$$$$$$$$$$´´´´´´´´´´´$   ``$$´´´´´´´´´´´´$$$$$$$$$$$$´´´´´´´´´´$$   ```$$´´´´´´´´´´´´$$$$$$$$$$´´´´´´´´´´$$   ````$´´´´´´´´´´´´$$$$$$$$$´´´´´´´´´´´$   `````$´´´´´´´´´´´$$$$$$$$´´´´´´´´´´´$   ``````$$´´´´´´´´´$$$$$$´´´´´´´´´´´$$   ````````$$´´´´´´$$$$$´´´´´´´´´´´$$   ``````````$$$´$$$$´´´´´´´´´´´$$$   `````````````$$$$$´´´´´´$$$$$   ``````````````````$$$$$$   */   #include  bits/stdc++.h        #define ll long long int   #define pb push_back   #define F first   #define S second   #define vi vector<ll>   #define vs vector<string>   #define input(v,n) for(ll VAL=0;VAL<n;VAL++){ll VALUE;cin>>VALUE;v.pb(VALUE);}   #define mi map<ll,ll>   #define FOR(i,a,b) for(ll i=a;i<b;i++)   #define mi map<ll,ll>   #define print(v) for(ll printing=0;printing<v.size();printing++){cout<<v[printing]<<   ;}   #define TestCase ll testcase;cin>>testcase;while(testcase--)   #define bin(n) bitset<32>(n).to_string();   #define maxv(v) *max_element(v.begin(),v.end())   #define minv(v) *min_element(v.begin(),v.end())   #define decimal(s) stoll(s,nullptr,2)   #define rmLead(str) str.erase(0, min(str.find_first_not_of( 0 ), str.size()-1));   using namespace std;      void solve(){       ll n,c;cin>>n>>c;       vi a(n),b(n-1);       for(auto &i:a)  cin>>i;       for(auto &i:b)  cin>>i;       b.pb(0);       ll prev_val = 0,prev_day=0;       ll ans = 1e18;       for(ll i=0;i<n;i++){           ll x = (c-prev_val+a[i]-1)/a[i];           ans = min(prev_day+max(x,(ll)0),ans);           x = max((ll)0,(b[i]-prev_val+a[i]-1)/a[i]);              prev_day+=x+1;           prev_val+=x*a[i]-b[i];         }       // ll x = (c-prev_val+a[n-1]-1)/a[n-1];       // ans = min(ans,prev_day+max(x,(ll)0));       //print(dp);       cout<<ans<<  n ;      }       int main(){   ios_base::sync_with_stdio(false);    cin.tie(NULL);   cout.tie(NULL);   TestCase   solve();   } 