#include<bits/stdc++.h>
using namespace std;
int n,m,a,b,c,x,y,p,q,ans=INT_MAX;
struct edge{int i,y,p,q;};
vector<edge> g[1000001];
int cal(int x){return a*x*x+b*x+c;}
void dfs(int x,int q,int sum){
	if(x==n){
		ans=min(ans,sum+q);
		return;
	}
	for(edge u:g[x]){
		if(u.p>=q) dfs(u.y,u.q,sum+cal(u.p-q));
	}
}
int main(){
    freopen("rout.in","r",stdin);
    freopen("rout.out","w",stdout);
    cin>>n>>m>>a>>b>>c;
	for(int i=1;i<=m;i++){
	    cin>>x>>y>>p>>q;
		g[x].push_back(edge{i,y,p,q});
	}
	dfs(1,0,0);
	cout<<ans;
}