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

INT n, m, k, ans, X;
vector<INT> a[10];
void solve(INT x, INT y)
{
    if( x == n )
    {
        for(int i = 0 ; i < n ; i++ )
        {
            for(int j = 0 ; j < a[i].size() ; j++ )
                cout<<a[i][j]<<" ";
            cout<<endl;
        }
        ans++;
        return;
    }
    if( y == a[x].size() )
    {
        solve(x+1, 0);
        return;
    }
    INT p;
    if( x == 0 and y == 0 ) p = x+1;
    else if( x == 0 ) p = a[x][y-1];
    else if( y == 0 ) p = a[x-1][y]+1;
    else p = max(a[x-1][y]+1, a[x][y-1]);
    for(int i = p ; i <= k ; i++ )
    {
        a[x][y] = i;
        solve(x, y+1);
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin>>n;
    for(int i = 0 ; i < n ; i++ )
    {
        cin>>m;
        a[i].resize(m);
    }
    cin>>k;
    solve(0, 0);
    cout<<ans<<endl;
    return 0;
}