#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const long long N = 2e5 + 7;
const int mod = 1e9 + 7;
bool cmp(const pair<long long, long long>& a,
         const pair<long long, long long>& b) {
  return a.first < b.first;
}
void solve() {
  long long x, t, a, b, da, db;
  cin >> x >> t >> a >> b >> da >> db;
  long long m = a, n = b;
  if (x == 0) {
    cout << "YES" << '\n';
    return;
  }
  for (long long i = 0; i < t; i++) {
    if (a == x) {
      cout << "YES" << '\n';
      return;
    }
    if (b == x) {
      cout << "YES" << '\n';
      return;
    }
    a = a - da;
    b = b - db;
  }
  a = m;
  b = n;
  for (long long i = 0; i < t; i++) {
    b = n;
    for (long long j = 0; j < t; j++) {
      if (a + b == x) {
        cout << "YES" << '\n';
        return;
      }
      b = b - db;
    }
    a = a - da;
  }
  cout << "NO" << '\n';
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  while (t--) {
    solve();
  }
}
