#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
int T;
ll k,len[10];
ll cal(ll a,ll b,ll c)
{
    return (2*a+(c-1)*b)*c/2;
}

ll cal2(ll a,ll b,ll c,ll d)
{
    return a*d*c+(a+b*d)*(c-1)*c/2+b*(c-1)*c*(c*2-1)/6;
}
ll solve(ll n)
{
    ll a=len[4],b,ans=1;
    ll t=min(n/4,a*2);
    if (t<=a) ans+=cal(4,4,n/4); else
    {
        ans+=cal(4,4,a);
        ans+=cal(a*4,-4,t-a);
    }
    for (int i=3;i>=1;i--)
    {
        a=len[i+1];
        b=len[i];
        t=min(n/i,b*2);
        if (b<a*2)
        {
            if (t<=a) continue;
            if (t<=b) ans+=cal(4,8,t-a);else
            if (t<=a*2)
            {
                ans+=cal(4,8,b-a);
                ans+=cal(b*4-(a*2-b)*4,0,t-b);
            }else
            if (t<=b*2)
            {
                ans+=cal(4,8,b-a);
                ans+=cal(b*4-4*(a*2-b),0,a*2-b);
                ans+=cal((b*2-a*2)*4,-4,t-a*2);
            }
        } else
        {
            if (t<=a) continue;
            if (t<=a*2) ans+=cal(4,8,t-a);else
            if (t<=b)
            {
                ans+=cal(4,8,a);
                ans+=cal((a*2+1)*4,4,t-a*2);
            }else
            if (t<=b*2)
            {
                ans+=cal(4,8,a);
                ans+=cal(8*a+4,4,b-a*2);
                ans+=cal(4*b,-4,t-b);
            }
        }
    }
    return ans;
}

ll solve2(ll n)
{
    ll a=len[4],b,ans=0;
    ll t=min(n/4,a*2);
    if (t<=a)
    {
        ans+=cal2(4,4,n/4,1)*4;
    } else
    {
        ans+=cal2(4,4,a,1)*4;
        ans+=cal2(a*4,-4,t-a,a+1)*4;
    }
    for (int i=3;i>=1;i--)
    {
        a=len[i+1];
        b=len[i];
        t=min(n/i,b*2);
        if (b<a*2)
        {
            if (t<=a) continue;
            if (t<=b) ans+=cal2(4,8,t-a,a+1)*i;else
            if (t<=a*2)
            {
                ans+=cal2(4,8,b-a,a+1)*i;
                ans+=cal2(b*4-(a*2-b)*4,0,t-b,b+1)*i;
            }else
            if (t<=b*2)
            {
                ans+=cal2(4,8,b-a,a+1)*i;
                ans+=cal2(b*4-(a*2-b)*4,0,a*2-b,b+1)*i;
                ans+=cal2((b*2-a*2)*4,-4,t-a*2,a*2+1)*i;
            }
        } else
        {
            if (t<=a) continue;
            if (t<=a*2) ans+=cal2(4,8,t-a,a+1)*i;else
            if (t<=b)
            {
                ans+=cal2(4,8,a,a+1)*i;
                ans+=cal2((a*2+1)*4,4,t-a*2,a*2+1)*i;
            }else
            if (t<=b*2)
            {
                ans+=cal2(4,8,a,a+1)*i;
                ans+=cal2((a*2+1)*4,4,b-a*2,a*2+1)*i;
                ans+=cal2(b*4,-4,t-b,b+1)*i;
            }
        }
    }
    return ans;
}

int main()
{
    scanf("%d",&T);
    while (T--)
    {
        for (int i=4;i>=1;i--) scanf("%lld",&len[i]);
        scanf("%lld",&k);
        ll l=0,r=1e10;
        while (l<r)
        {
            ll mid=(l+r)>>1;
            if (solve(mid)>=k) r=mid;else l=mid+1;
        }
        printf("%lld\n",solve2(l)-(solve(l)-k)*l);
    }
}