#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

int consistency(int n, int m, int x){
	if(n==1 && x == 1) return 1;
	if(n==1 && x != 1) return 0;
	
	vector<vector<int>> dp(n+1, vector<int>(x+1, 0));
	
	dp[0][0] = 1;
	dp[1][1] = 1;
	
			
	for(int i=2; i<=n; i++){
			
		for(int k=1; k<=x; k++){
			
			int j = i-1;
			int sum = a[i];
			while(j>=0 && sum <= m ){
				dp[i][k] +=  dp[j][k-1];
				
				sum += a[j];
				j--;
			}
		}
	}

	return dp[n][x];
}















int practice(int n, int m, int k){


    return 0;
}





void solve() {
    
    int n, m, k;
    cin >> n >> m >> k;
    
    a.resize(n+1);
    for(int i=1; i<=n; i++) cin >> a[i];
    
    cout << consistency(n, m, k) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}