import std; struct S { long num, pos, neg; } void main() { long N, K; readf("%d %d\n", N, K); auto A = readln.chomp.split.to!(long[]); long H = N / 2; S[] L; L ~= S(0, 0, 0); foreach (i; 0 .. H) { S[] nxt; foreach (l; L) { foreach (j; -1 .. 2) { auto s = l; s.num += A[i] * j; if (j == -1) s.neg = 1; if (j == 1) s.pos = 1; nxt ~= s; } } L = nxt; } S[] R; R ~= S(0, 0, 0); foreach (i; H .. N) { S[] nxt; foreach (r; R) { foreach (j; -1 .. 2) { auto s = r; s.num += A[i] * j; if (j == -1) s.neg = 1; if (j == 1) s.pos = 1; nxt ~= s; } } R = nxt; } auto X = new long[][][](2, 2); foreach (l; L) { X[l.pos][l.neg] ~= l.num; } auto Y = new bool[long][][](2, 2); foreach (r; R) { Y[r.pos][r.neg][r.num] = true; } bool isOK; foreach (i; 0 .. 4) { long p1 = (i >> 1) & 1, n1 = i & 1; foreach (j; 0 .. 4) { long p2 = (j >> 1) & 1, n2 = j & 1; if (p1 == 0 && p2 == 0) continue; if (n1 == 0 && n2 == 0) continue; foreach (x; X[p1][n1]) { long p = x + K, n = x - K; if (p in Y[p2][n2]) isOK = true; if (n in Y[p2][n2]) isOK = true; } } } writeln(isOK ? "Yes" : "No"); }