#include <bits/stdc++.h>
using namespace std;
const long long int MAX = 1e6 + 5;
const int N = 2e5 + 5;
const long long int mod = 1e9 + 7;
const long long int mx = 1e16;
bool comp(const int a, const int b) { return a > b; }
const double PI = 2 * acos(0.0);
long long int fac[N];
void pre() {
  fac[0] = 1LL;
  for (long long int i = 1; i < N; i++) {
    fac[i] = 1LL * i * fac[i - 1];
    if (fac[i] >= mod) fac[i] %= mod;
  }
}
long long int power(long long int a, long long int b) {
  long long int x = 1;
  while (b) {
    if (b & 1) {
      x *= a;
      if (x >= mod) x %= mod;
    }
    a *= a;
    if (a >= mod) a %= mod;
    b >>= 1;
  }
  return x;
}
long long int inv(long long int k) { return power(k, mod - 2); }
int main() {
  vector<int> v1, v2;
  int x, t, a, b, da, db;
  cin >> x >> t >> a >> b >> da >> db;
  int t1 = t;
  int t2 = t;
  int x1 = x;
  int x2 = x;
  if (x == 0) {
    printf("YES\n");
    return 0;
  }
  for (long long int i = 0; i < t; i++) {
    if (a - i * da == x || b - i * db == x) {
      printf("YES\n");
      return 0;
    }
  }
  for (long long int i = 0; i < t; i++) {
    for (long long int j = 0; j < t; j++) {
      int res = a - i * da + b - j * db;
      if (res == x) {
        printf("YES\n");
        return 0;
      }
    }
  }
  printf("NO\n");
}
