#include <bits/stdc++.h>
using namespace std;
int n, k, a[100005];
char s[20];
bool known[100005];
int p[3] = {666013, 3216107, 1000000007};
int main() {
  scanf("%d %d\n", &n, &k);
  int cntKnown = 0;
  for (int i = 0; i <= n; ++i) {
    scanf("%s\n", s);
    if (s[0] != '?') {
      known[i] = 1;
      a[i] = atoi(s);
      ++cntKnown;
    }
  }
  if (cntKnown == n + 1) {
    int r[3] = {0, 0, 0};
    for (int i = n; i >= 0; --i)
      for (int j = 0; j < 3; ++j) r[j] = (1LL * r[j] * k + a[i]) % p[j];
    for (int i = 0; i < 3; ++i)
      if (r[i]) {
        printf("No\n");
        return 0;
      }
    printf("Yes\n");
    return 0;
  }
  if (k != 0) {
    printf("%s\n", (n % 2 == 1) ? "Yes" : "No");
    return 0;
  }
  printf("%s\n", ((known[0] && a[0] == 0) || (!known[0] && cntKnown % 2 == 1))
                     ? "Yes"
                     : "No");
  return 0;
}
