#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
long long ar[100010];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  long long k;
  cin >> n >> k;
  int fl = 0, cnt = 0;
  for (int i = (0); i < (n + 1); ++i) {
    string s;
    cin >> s;
    if (s == "?") {
      fl = 1;
      ar[i] = 1000000007ll;
      continue;
    }
    cnt++;
    istringstream is(s);
    is >> ar[i];
  }
  if (k == 0 && ar[0] == 0) {
    cout << "Yes" << endl;
    return 0;
  }
  if (k == 0 && ar[0] == 1000000007ll && (cnt % 2) == 1) {
    cout << "Yes" << endl;
    return 0;
  }
  if (k == 0) {
    cout << "No" << endl;
    return 0;
  }
  if (fl) {
    if (n % 2)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
    return 0;
  }
  long long mx = 10000ll * 10000ll * 10000ll * 100ll;
  for (int i = n - 1; i >= 0; i--) {
    if (abs(ar[i + 1]) > mx) {
      cout << "No" << endl;
      return 0;
    }
    ar[i] += ar[i + 1] * k;
  }
  if (ar[0] == 0)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
