import java.util.BitSet;

public class Main {
  private static void solve() {
    int n = ni();
    int k = ni();
    int[] a = na(n);

    BitSet[] l = new BitSet[n + 2];
    BitSet[] r = new BitSet[n + 2];
    for (int i = 0; i < n + 2; i ++) {
      l[i] = new BitSet();
      r[i] = new BitSet();
    }

    l[0].set(0);;
    r[n + 1].set(0);

    for (int i = 0; i < n; i++) {
      for (int j = 0; j <= k; j++) {
        if (l[i].get(j) || j >= a[i] && l[i].get(j - a[i])) {
          l[i + 1].set(j);
        }
      }
    }

    for (int i = n + 1; i >= 2; i--) {
      for (int j = 0; j <= k; j++) {
        if (r[i].get(j) || j >= a[i - 2] && r[i].get(j - a[i - 2])) {
          r[i - 1].set(j);
        }
      }
    }

    int[][] rsum = new int[n + 2][k + 2];
    for (int i = 1; i <= n + 1; i++) {
      for (int j = 0; j <= k; j++) {
        rsum[i][j + 1] = (r[i].get(j) ? 1 : 0) + rsum[i][j];
      }
    }

    int ret = 0;
    for (int i = 1; i <= n; i++) {
      int v = a[i - 1];

      for (int s = 0; s <= k; s++) {
        if (l[i - 1].get(s)) {
          if (rsum[i + 1][Math.max(k - v - s, 0)] != rsum[i + 1][k - s]) {
            ret ++;
            break;
          }
        }
      }
    }
    System.out.println(n - ret);
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}


Measured memory_bytes: 162428