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

const int maxn=400005;
int T,m,len[4];
long long k;
pair<int,int>val[maxn*4];

bool cmp(pair<int,int>a,pair<int,int>b){
    return a.first*a.second<b.first*b.second;
}

long long calc(int d,int lim){
    if(d==0)return 1;
    if(2*lim<d)return 0;
    if(d<=lim)return 4LL*d;
    else return 4LL*(2LL*lim-d+1);
}

int main(){
    for(int i=0;i<=400000;i++)for(int j=1;j<=4;j++)
        val[++m]=make_pair(i,j);
    sort(val+1,val+1+m,cmp);
    scanf("%d",&T);
    while(T--){
        scanf("%d%d%d%d%lld",&len[0],&len[1],&len[2],&len[3],&k);
        long long ans=0;
        for(int i=1;i<=m;i++){
            long long cnt=calc(val[i].first,len[4-val[i].second]);
            if(val[i].second<4)cnt-=calc(val[i].first,len[4-(val[i].second+1)]);
            ans+=min(cnt,k)*val[i].first*val[i].second;
            k-=min(cnt,k);
            if(!k)break;
        }
        assert(!k); 
        printf("%lld\n",ans);
    }
    return 0;
}