import std;

void main() {
    long N, K;
    readf("%d %d\n", N, K);

    auto A = readln.chomp.split.to!(long[]);

    long H = N / 2;

    bool[long] L, R;
    L[0] = R[0] = true;

    foreach (i; 0 .. H) {
        bool[long] nxt;
        foreach (key; L.byKey) {
            foreach (j; -1 .. 2) {
                nxt[key+A[i]*j] = true;
            }
        }

        L = nxt;
    }

    foreach (i; H .. N) {
        bool[long] nxt;
        foreach (key; R.byKey) {
            foreach (j; -1 .. 2) {
                nxt[key+A[i]*j] = true;
            }
        }

        R = nxt;
    }

    bool isOK;
    foreach (l; L.byKey) {
        if (l + K in R && !(l == 0 || l + K == 0)) isOK = true;
        if (l - K in R && !(l == 0 || l - K == 0)) isOK = true;
    }

    writeln(isOK ? "Yes" : "No");
}