#include <iostream>
#include <fstream>
#include <cassert>
#include <typeinfo>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#include <random>
#include <complex>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<P,int> pip;
typedef vector<pip> vip;
const int inf=1<<28;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

ll n,H,A,D,S;
vl h,a;

int main(){
	cin>>n>>H>>A>>D>>S;
	ll res=H,as=0;
	h=a=vl(n);
	vector<pair<double,int> > b;
	for(int i=0;i<n;i++){
		ll d,s;
		cin>>h[i]>>a[i]>>d>>s;
		a[i]=max(a[i]-D,0ll);
		as+=a[i];
		if(A<=d&&a[i]){
			cout<<-1<<endl;
			return 0;
		}
		if(A-d>0){
			ll da=A-d;
			h[i]=(h[i]+da-1)/da;
			if(s>S) res-=a[i];
			if(a[i]){
				b.push_back({(double)h[i]/a[i],i});
			}
		}
	}
	sort(b.begin(),b.end());
	int B=b.size();
	for(int i=0;i<B;i++){
		int I=b[i].second;
		if(res<as-a[I]){
			cout<<-1<<endl;
			return 0;
		}
		res-=as*h[I]-a[I];
		as-=a[I];
		if(res<=0){
			cout<<-1<<endl;
			return 0;
		}
	}
	cout<<H-res<<endl;
}