Elimination

你要举办一个比赛，这个比赛分为淘汰赛和附加赛。其中，淘汰赛需要 $c$ 个问题，晋级 $n$ 人；附加赛需要 $d$ 个问题，只晋级 $1$ 人。除此之外，有 $k$ 个人直接晋级，不用参加上述比赛 现要求 **至少** $n \times m$ 个人晋级，求需要的最少题目数。 输入格式： 第一行输入 $c$，$d$。$1 \le c,d\le 100$。 第二行输入 $n$，$m$。$1 \le n,m\le 100$。 第一行输入 $k$。$1 \le k\le 100$。

The finalists of the "Russian Code Cup" competition in 2214 will be the participants who win in one of the elimination rounds. The elimination rounds are divided into main and additional. Each of the main elimination rounds consists of $ c $ problems, the winners of the round are the first $ n $ people in the rating list. Each of the additional elimination rounds consists of $ d $ problems. The winner of the additional round is one person. Besides, $ k $ winners of the past finals are invited to the finals without elimination. As a result of all elimination rounds at least $ n·m $ people should go to the finals. You need to organize elimination rounds in such a way, that at least $ n·m $ people go to the finals, and the total amount of used problems in all rounds is as small as possible.

The first line contains two integers $ c $ and $ d $ ( $ 1<=c,d<=100 $ ) — the number of problems in the main and additional rounds, correspondingly. The second line contains two integers $ n $ and $ m $ ( $ 1<=n,m<=100 $ ). Finally, the third line contains an integer $ k $ ( $ 1<=k<=100 $ ) — the number of the pre-chosen winners.

In the first line, print a single integer — the minimum number of problems the jury needs to prepare.

1 10
7 2
1

2

2 2
2 1
2

0