#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <climits>
//#include <cstdlib>
//#include <ctime>
//#include <sstream>
//#include <windows.h>
//#include <queue>
//#include <set>
//#include <map>
using  namespace std;
 
const int maxn=1000+10;
const int maxm=1000+10;

int n,t,m;
int a[maxn];
int f[21][21][21];
int main()
{
	freopen("rockers.in","r",stdin);
	freopen("rockers.out","w",stdout);
	cin>>n>>t>>m;
	for(int i=1; i<=n; i++)
		scanf("%d",&a[i]);
	for(int i=1 ;i<=n; i++)
	{
		for(int j=1 ;j<=m; j++)
		{
			for(int k=1; k<=t; k++)
			{
				f[i][j][k]=f[i-1][j][k];
				if(k>=a[i])
					f[i][j][k]=max(f[i][j][k],1+max(f[i-1][j][k-a[i]],f[i-1][j-1][t]));
			}
		}
	}
	cout<<f[n][m][t]<<endl;
	return 0;
}