import static java.lang.Math.max;

import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;

public class Main {
    public static void main(String[] args) {
        FastScanner fsc = new FastScanner();
        int n = fsc.nextInt();
        int k = fsc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = fsc.nextInt();
        }
        int[][] backsum = new int[n + 1][k + 1];
        backsum[n][1] = 1;
        for (int i = n - 1; i >= 0; i--) for (int j = 1; j <= k; j++) {
            if (backsum[i + 1][j] > 0) {
                backsum[i][j] = 1;
                if (j + a[i] <= k) {
                    backsum[i][j + a[i]] = 1;
                }
            }
        }
        for (int i = 0; i <= n; i++) for (int j = 1; j <= k; j++) {
            backsum[i][j] += backsum[i][j - 1];
        }
        int need = 0;
        boolean[] front = new boolean[k];
        for (int i = 0; i < n; i++) {
            if (i == 0) {
                front[0] = true;
            } else {
                for (int j = k - 1; j >= 0; j--) {
                    if (j - a[i - 1] >= 0) {
                        front[j] |= front[j - a[i - 1]];
                    }
                }
            }
            for (int j = 0; j < k; j++) {
                if (front[j] && backsum[i + 1][k - j] - backsum[i + 1][max(0, k - a[i] - j)] > 0) {
                    ++need;
                    break;
                }
            }
        }
        System.out.println(n - need);
    }
}

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }

    private int readByte() {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    }

    private static boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }

    public boolean hasNext() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
        return hasNextByte();
    }

    public String next() {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }

    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
            throw new NumberFormatException();
        return (int) nl;
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }
}


Measured memory_bytes: 166840