#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
  int A,B;
  cin >> A >> B;
  string S;
  cin >> S;
  for(int i=0;i<(int)S.size();i++){
    if(i==A){
      if(S[i]!='-'){
        cout << "No" << endl;
        return 0;
      }
    }
    else{
      if(!(S[i]-'0'>=0 && S[i]-'0'<=9)){
        cout << "No" << endl;
        return 0;
      }
    }
  }
  cout << "Yes" << endl;
}
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%lld",&x);
int main(){
    ll n, a, b;
    sc(n) sc(a) sc(b)
    ll X[n];
    for (int i = 0; i < n; i++) sc(X[i])
    ll x,ans = 0;
    for (int i = 0; i < n - 1; i++){
        x = (X[i + 1] - X[i]) * a;
        ans += min(x, b);
    }
    cout << ans << endl;
    return 0;
}