4110: CF106 - C. Buns
[Creator : ]
Description
Lavrenty, a baker, is going to make several buns with stuffings and sell them.
Lavrenty has $n$ grams of dough as well as $m$ different stuffing types. The stuffing types are numerated from $1$ to $m$. Lavrenty knows that he has $a_i$ grams left of the $i$-th stuffing. It takes exactly $b_i$ grams of stuffing $i$ and $c_i$ grams of dough to cook a bun with the $i$-th stuffing. Such bun can be sold forditugriks.
Also he can make bunswithout stuffings. Each of such buns requires $c_0$ grams of dough and it can be sold for $d_0$ tugriks. So Lavrenty can cook any number of buns with different stuffings or without it unless he runs out of dough and the stuffings. Lavrenty throws away all excess material left after baking.
Find the maximum number of tugriks Lavrenty can earn.
Also he can make bunswithout stuffings. Each of such buns requires $c_0$ grams of dough and it can be sold for $d_0$ tugriks. So Lavrenty can cook any number of buns with different stuffings or without it unless he runs out of dough and the stuffings. Lavrenty throws away all excess material left after baking.
Find the maximum number of tugriks Lavrenty can earn.
Input
The first line contains four integers $n,m,c_0,d_0\ (1≤n≤1000,\ 1≤m≤10,\ 1≤c_0,d_0≤100)$.
Each of the following $m$ lines contains four integers. The $i$-th line contains numbers $a_i,b_i,c_i,d_i\ (1≤a_i,b_i,c_i,d_i≤100)$.
Each of the following $m$ lines contains four integers. The $i$-th line contains numbers $a_i,b_i,c_i,d_i\ (1≤a_i,b_i,c_i,d_i≤100)$.
Output
Print the only number − the maximum number of tugriks Lavrenty can earn.
Sample 1 Input
10 2 2 1
7 3 2 100
12 3 1 10
Sample 1 Output
241
To get the maximum number of tugriks in the first sample, you need to cook 2 buns with stuffing 1, 4 buns with stuffing 2 and a bun without any stuffing.
Sample 2 Input
100 1 25 50
15 5 20 10
Sample 2 Output
200
Lavrenty should cook 4 buns without stuffings.