#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+99,M=2e5+99,lim=1000;
int n,m;
ll a,b,c;
ll f(ll x){
	return a*x*x+b*x+c;
}
struct route{
	int x,y,p,q;
	bool operator <(const route&A) const{
		return p<A.p;
	}
}r[M];
struct node{
	int tim,l,r;
	ll val;
};
struct Node{
	int id,tim;
	ll val;
	bool operator <(const Node&A) const{
		return tim>A.tim;
	}
};
vector<node> que[N];
int hh[N],tt[N];
void update(int x,int tim,ll val){
	while(tt[x]>=hh[x]){
		if(que[x][tt[x]].l>=tim&&que[x][tt[x]].val+f(que[x][tt[x]].l-que[x][tt[x]].tim)>=val+f(que[x][tt[x]].l-tim)){
			tt[x]--; que[x].pop_back(); continue;
		}
		else if(que[x][tt[x]].r<tim||(que[x][tt[x]].val+f(que[x][tt[x]].r-que[x][tt[x]].tim)<val+f(que[x][tt[x]].r-tim)))
			break;
		int l=max(que[x][tt[x]].l+1,tim),r=que[x][tt[x]].r,mid; int re=l-1;
		while(l<=r){
			mid=(l+r>>1);
			if(que[x][tt[x]].val+f(mid-que[x][tt[x]].tim)<val+f(mid-tim)) re=mid,l=mid+1;
			else r=mid-1;
		}
		que[x][tt[x]].r=re;
		break;
	}
	if(tt[x]<hh[x]){
		++tt[x];
		que[x].push_back((node){tim,tim,lim,val});
	}
	else if(que[x][tt[x]].r!=lim){
		++tt[x];
		que[x].push_back((node){tim,que[x][tt[x]-1].r+1,lim,val}); 
	}
	return;
}
void upd(int x,int tim){
	while(hh[x]<=tt[x]){
		if(que[x][hh[x]].r<tim) hh[x]++;
		else{
			que[x][hh[x]].l=max(que[x][hh[x]].l,tim);
			break;
		}
	}
	return;
}
int main(){
//	freopen("route.in","r",stdin);
//	freopen("route.out","w",stdout);
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>n>>m>>a>>b>>c;
	for(int i=1;i<=m;i++)
		cin>>r[i].x>>r[i].y>>r[i].p>>r[i].q;
	sort(r+1,r+m+1);
	que[1].push_back((node){0,0,lim,0}); tt[1]=0;
	for(int i=2;i<=n;i++) tt[i]=-1;
	priority_queue<Node> pq; Node now;
	int x,y,p,q; ll nval,ans=1e17;
	for(int i=1;i<=m;i++){
		x=r[i].x; y=r[i].y; p=r[i].p; q=r[i].q;
		while(!pq.empty()&&pq.top().tim<=p){
			now=pq.top(); pq.pop();
			update(now.id,now.tim,now.val);
		}
		upd(x,p);
		if(hh[x]>tt[x]) continue;
		nval=que[x][hh[x]].val+f(p-que[x][hh[x]].tim);
		if(y==n) ans=min(ans,nval+q);
		else pq.push((Node){y,q,nval});
	}
	cout<<ans;
	return 0;
}