#include <bits/stdc++.h>
const int INF_INT = 0x3f3f3f3f;
const long long INF_LL = 0x7f7f7f7f;
const long long MOD = 4000000017;
const double eps = 1e-10;
const double pi = acos(-1);
using namespace std;
long long n, k;
long long a[100010];
int main(int argc, char const *argv[]) {
  while (cin >> n >> k) {
    string s;
    int op = 0;
    for (int i = 0; i <= n; i++) {
      cin >> s;
      if (s[0] == '?')
        a[i] = INF_INT;
      else {
        op++;
        long long flag = 1LL;
        int cnt = 0;
        if (s[cnt] == '-') flag = -1, cnt++;
        int tmp = 0;
        while (cnt < s.size()) {
          tmp = tmp * 10 + s[cnt++] - '0';
        }
        a[i] = tmp * flag;
      }
    }
    if (k == 0) {
      if (a[0] == 0)
        puts("Yes");
      else if (a[0] >= INF_INT)
        puts(op % 2 == 1 ? "Yes" : "No");
      else
        puts("No");
    } else {
      if (op < n + 1)
        puts((n + 1) % 2 == 1 ? "No" : "Yes");
      else {
        long long tmp = 0;
        for (int i = n; i >= 1; i--) {
          tmp = tmp * k + a[i];
          tmp %= MOD;
        }
        if (tmp % MOD * k * -1 % MOD == a[0] % MOD)
          puts("Yes");
        else
          puts("No");
      }
    }
  }
  return 0;
}
