DFS

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

int a[5];
map<int,int> mp1;
int n,geshu;

void dfs(int num,int sum1)
{
    if(num==n)
    {
        if(sum1%3==0)
        {
            geshu++;
        }
        return;
    }
    for(int i=0;i<5;i++)
    {
        if((num==0&&i==0)&&n!=1)
        {
            continue;
        }
        if(mp1[i]<a[i])
        {
            mp1[i]++;
            dfs(num+1,sum1+i);
            mp1[i]--;
        }
        else
        {
            continue;
        }
        
    }
    return;
}
void slove()
{
    geshu=0;
    cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4];
    cin>>n;
    mp1[0]=0;mp1[1]=0;mp1[2]=0;mp1[3]=0;mp1[4]=0;
    dfs(0,0);
    cout<<geshu<<endl;
}

int main()
{
    int t;
    cin>>t;
    for(int i=0;i<t;i++)
    {
        slove();
    }
}