#include <stdio.h>

 #include <string.h>

 const int N=;

 __int64 dp[N][N];

 __int64 a[N];

 int main()

 {

     __int64 n,m;

     while(~scanf("%I64d%I64d",&n,&m))

     {

         if (n==&&m==)

             break;

         memset(dp,,sizeof(dp));

         for (int i = ;i <= n; i++)

         {

             scanf("%I64d",&a[i]);

             dp[i][] = ;

         }

         for (int i = ;i <= n; i++)

         {

             for (int j = ;j <= m; j++)

             {

                 for (int k = ;k < i; k++)

                 {

                     if (a[k] < a[i]) //前i个数长度为j的递增子序列数目

                                      //=（a[i] > a[k]&&k < i）前k个数中长度为j-1的递增子序列数目的和

                         dp[i][j]+=dp[k][j-];

                 }

             }

         }

         __int64 ans = ;

         for (int i = ;i <= n; i++)

            ans+=dp[i][m];

         printf("%I64d\n",ans);

     }

     return ;

 }