using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray(); public static void Main() { Solve(); } static void Solve() { var c = NList; var (n, k) = (c[0], c[1]); var a = NList; YN(Make(n, k, a)); } static bool Make(int n, int k, int[] a) { var first = new HashSet[4]; for (var i = 0; i < first.Length; ++i) first[i] = new HashSet(); var bitmax = (int)Math.Pow(3, n / 2); for (var b = 0; b < bitmax; ++b) { var sum = 0L; var tmp = b; var plus = false; var minus = false; for (var i = 0; i < n / 2; ++i) { sum += a[i] * (tmp % 3 - 1); if (tmp % 3 == 0) minus = true; if (tmp % 3 == 2) plus = true; tmp /= 3; } if (!plus && !minus) first[0].Add(sum); else if (!plus && minus) first[1].Add(sum); else if (plus && !minus) first[2].Add(sum); else first[3].Add(sum); } bitmax = (int)Math.Pow(3, n - n / 2); for (var b = 0; b < bitmax; ++b) { var sum = 0L; var tmp = b; var plus = false; var minus = false; for (var i = 0; i < n - n / 2; ++i) { sum += a[i + n / 2] * (tmp % 3 - 1); if (tmp % 3 == 0) minus = true; if (tmp % 3 == 2) plus = true; tmp /= 3; } if (plus && minus) { if (first[0].Contains(k + sum) || first[0].Contains(sum - k)) return true; } if (plus) { if (first[1].Contains(k + sum) || first[1].Contains(sum - k)) return true; } if (minus) { if (first[2].Contains(k + sum) || first[2].Contains(sum - k)) return true; } if (first[3].Contains(k + sum) || first[3].Contains(sum - k)) return true; } return false; } static void YN(bool b) { WriteLine(b ? "Yes" : "No"); } }