#include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
  while (b) b ^= a ^= b ^= a %= b;
  return a;
}
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, -1, 1};
inline int src() {
  int ret;
  scanf("%d", &ret);
  return ret;
}
int x, t, a, b, da, db;
int main() {
  int i, j, k;
  int TC, tc;
  cin >> x >> t >> a >> b >> da >> db;
  bool isSol = false;
  if (x == 0) {
    cout << "YES\n";
    return 0;
  }
  for (int i = (int)0; i <= (int)t - 1; i++) {
    for (int j = (int)0; j <= (int)t - 1; j++)
      if ((a - i * da) + (b - j * db) == x || (a - i * da) == x ||
          (b - i * db) == x) {
        isSol = true;
        break;
      }
  }
  if (isSol)
    cout << "YES\n";
  else
    cout << "NO\n";
  return 0;
}
