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

ll T, aim, lim[6];

ll shit0(ll n,ll m){
    if (n<0) return 0;
    if (m<=n){
        return m*(m+1)/2*4+1;
    }
    ll t=(2*n+1)*(2*n+1);
    if (n+n<=m) return t;
    ll l=2*n-m;
    ll d=(l+1)*l/2;
    return t-d*4;
}

ll calc0(ll m){
    ll res=0;
    for (int i=1;i<=4;++i){
        ll v=5-i;
        ll t=shit0(lim[i],m/v)-shit0(lim[i-1],m/v);
        res+=t;
    }
    return res;
}

ll shit1(ll n,ll m){
    if (n<0) return 0;
    if (m<=n){
        return m*(m+1)*(2*m+1)/6*4;
    }
    ll t=n*(n+1)*(2*n+1)*2;
    if (n+n<=m) return t;
    ll l=2*n-m;
    ll d=(l*(l+1)*(2*l+1)/6+(l+1)*l/2*(m-n))*2;
    return t-d*4;
}

ll calc1(ll m){
    ll res=0;
    for (int i=1;i<=4;++i){
        ll v=5-i;
        ll t=shit1(lim[i],m/v)-shit1(lim[i-1],m/v);
        res+=t*v;
    }
    return res;
}

ll fuck(){
    if (aim<=1) return 0;
    ll l=0, r=1e6, res=0;
    for (;l<=r;){
        ll mid=(l+r)/2;
        if (calc0(mid)<=aim){
            res=mid; l=mid+1;
        }else{
            r=mid-1;
        }
    }
    return calc1(res)+(res+1)*(aim-calc0(res));
}

int main(){
    for (cin>>T;T--;){
        lim[0]=-1;
        for (int i=1;i<=4;++i) cin>>lim[i];
        cin>>aim;
        cout<<fuck()<<endl;
    }
}