#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
const int INF = INT_MAX;
const long long INFLL = (long long)1e18;
const double PI = acos(-1.0);
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
const int N = (int)2e5 + 5;
const int P = 1 << 18;
int n, m, k;
int a[N];
int main() {
  ios::sync_with_stdio(false);
  cout.setf(ios::fixed | ios::showpoint);
  cout.precision(8);
  cin >> n >> m >> k;
  for (int i = n - 1; i >= 0; i--) {
    cin >> a[i];
  }
  int ans = 1;
  int pos = 1;
  for (int i = 0; i < m; i++) {
    int cur = k;
    if (i == 0) {
      cur -= a[0];
    }
    if (pos >= n) {
      break;
    }
    while (pos < n && a[pos] <= cur) {
      ans++;
      cur -= a[pos];
      pos++;
    }
  }
  cout << ans << endl;
  return 0;
}
