Description

Duplicated of #6520. 「ICPC PacNW 2017 Div.1」David 的旅程

There are $n$ railway stations in the Kingdom of Cat, numbered from $1$ to $n$. Little cat is going home (at station $n$) from station $1$. There are $m$ trains in the kingdom, numbered from $1$ to $m$. For the $i$-th train, it will depart station $x_i$ at time $p_i$, and arrive at station station $y_i$ directly at time $q_i$. At time $0$, little cat is at station $1$.

Little cat can go home by multiple transfers. One transfer is that for a pair of trains $u$ and $v$, if $y_u = x_v$ and $q_u \leq p_v$, then after taking train $u$, little cat can wait at station $y_u$ for $p_v - q_u$ time units, and take train $v$ at time $p_v$.

Little cat wants to minimize its anxiety, which is calculated as followed:

• If little cat waits at some stations for $t\,(t \geq 0)$ time units, its anxiety will be increased by $At^2 + Bt + C$, where $A, B, C$ are given constants.
  • Note that before little cat taking the first train at time $t$, it has been waiting for $t$ time units at station $1$.
• If little cat arrives at station $n$ at time $z$, its anxiety will be increased by $z$.

Formally, if little cat takes $k$ trains totally, whose numbers are $s_1, s_2, \cdots, s_k$, little cat can get home if and only if:

• $x_{s_1} = 1, y_{s_k} = n$
• $y_{s_j} = x_{s_{j + 1}}$ and $q_{s_j} \leq p_{s_{j + 1}}$ hold for $1 \leq j < k$

and its anxiety will be

$$q_{s_k} + (A \cdot p_{s_1}^2 + B \cdot p_{s_1} + C) + \sum_{j = 1}^{k - 1}\left(A(p_{s_{j + 1}} - q_{s_j})^2 + B(p_{s_{j + 1}} - q_{s_j}) + C\right) $$

Your task is to figure out the minimal anxiety.

Input

The first line contains $5$ integers $n, m, A, B, C$.

Each of the next $m$ lines contains $4$ integers $p_i, q_i, x_i, y_i$.

It is guaranteed that there is at least one way for little cat to go home.

Output

Print a single integer — the minimal anxiety.

3 4 1 5 10
1 2 3 4
1 2 5 7
1 2 6 8
2 3 9 10

94

4 3 1 2 3
1 2 2 3
2 3 5 7
3 4 7 9

34

Limits And Hints

For all of the tests, $2 \leq n \leq 10^5$, $1 \leq m \leq 2 \times 10^5$, $0 \leq A \leq 10$, $0 \leq B, C \leq 10^6$, $1 \leq x_i, y_i \leq n$, $x_i \neq y_i$, $0 \leq p_i < q_i \leq 10^3$.