int main()
{
    int n;
    cin>>n;
    int A[n];
    f(i,0,n) cin>>A[i];
    int k;
    cin>>k;
    int dp[n][k+1];// dp[i][j] = number of sequences of size j ending at position i
    dp[0][1]=1;
    f(i,1,n)
    {
        dp[i][1]=1;
        f(j,2,k+1)
        {
            dp[i][j]=0;
            f(p,0,i)
            {
                if(A[p]<A[i])
                {
                    dp[i][j]+=dp[p][j-1];
                }
            }
        }
    }
    int ans=0;
    f(i,0,n) ans+=dp[i][k];
    cout<<ans<<"\n";
    return 0;
}