/*
 * Solution Template for Emptying Vaults
 * 
 * Australian Informatics Olympiad 2026 Invitationals
 * 
 * This file is provided to assist with reading of input and writing of output
 * for the problem. You may modify this file however you wish, or
 * you may choose not to use this file at all.
 */

#include <cstdio>

/*
 * N is the number of vaults, P is their capacity, and K is the time available.
 */
int N;
int P;
int K;
/* B contains the coin counts. The array starts from 0. */
int B[200005];

int answer;
int main(void) {
  /* Read N, P, K, and the initial coin counts. */
  scanf("%d%d%d", &N, &P, &K);
  for (int i = 0; i < N; i++) {
    scanf("%d", &B[i]);
  }

  /*
   * TODO: Compute the maximum number of empty vaults. Coin totals may exceed
   * 32-bit integer range.
   */

  /* Write the answer. */
  printf("%d\n", answer);

  return 0;
}