#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL len[5], k;
LL F(LL l, LL r, LL v) {
    if (l) return F(0, r, v) - F(0, l - 1, v);
    // 0 <= |x|, |y| <= r, |x| + |y| = v
    if (v <= r) return 4 * v;
    if (2 * r < v) return 0;
    return 4 * (2 * r - v + 1);
}
void solve() {
    cin >> len[1] >> len[2] >> len[3] >> len[4] >> k;
    if (k <= 1) {
        printf("0\n");
        return ;
    }
    LL cnt = 1, ans = 0;
    for (LL v = 1;  ; v++) {
        LL cur = 0;
        if (v % 4 == 0) cur += F(1, len[1], v / 4);
        if (v % 3 == 0) cur += F(len[1] + 1, len[2], v / 3);
        if (v % 2 == 0) cur += F(len[2] + 1, len[3], v / 2);
        if (v % 1 == 0) cur += F(len[3] + 1, len[4], v / 1);
        if (cnt + cur >= k) {
            ans += (k - cnt) * v;
            printf("%lld\n", ans);
            return ;
        } else {
            cnt += cur;
            ans += cur * v;
        }
    }
}
int main() {
    int T;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}