#include <bits/stdc++.h>

using namespace std;

#define REP(i, n) for (int i=0; i<(n); ++i)
#define RREP(i, n) for (int i=(int)(n)-1; i>=0; --i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, n) for (int i=(int)(n)-1; i>=(a); --i)

#define SZ(x) ((int)(x).size())
#define all(x) begin(x),end(x)

#define dump(x) cerr<<#x<<" = "<<(x)<<endl
#define debug(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<<endl;

template<class T>
ostream &operator<<(ostream &os, const vector <T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

template<class T, class U>
ostream &operator<<(ostream &os, const pair <T, U> &p) {
    return os << "(" << p.first << " " << p.second << ")";
}

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvll = vector<vll>;

const ll MOD = 1e9 + 7;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;
const ld eps = 1e-9;


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    ll ans = 0;

    int n; cin >> n;
    ll H, A, D, S;
    cin >> H >> A >> D >> S;
    vll t, b, u;
    REP(i, n) {
        int h, a, d, s;
        cin >> h >> a >> d >> s;
        int dam2p = max(a - D, 0LL);
        if (dam2p == 0) continue;
        int dam2this = max(A - d, 0LL);
        if (dam2this == 0) {
            ans = -1;
            continue;
        }

        t.push_back((h-1) / dam2this + 1);
        b.push_back(dam2p);
        u.push_back(S > s);
    }
    if (ans == -1) {
        cout << -1 << endl;
        return 0;
    }

    n = t.size();

    vi ord(n); iota(all(ord), 0);
    sort(all(ord), [&](int i,int j){
        return (double)t[i] / b[i] < (double)t[j] / b[j];
    });

    ll tsum = 0;
    for (int i : ord) {
        tsum += t[i];
        ans += (tsum - u[i]) * b[i];
        if (ans >= H) {
            ans = -1;
            break;
        }
    }
    cout << ans << endl;

    return 0;
}

