CF1150A.Stock Arbitraging

Welcome to Codeforces Stock Exchange! We're pretty limited now as we currently allow trading on one stock, Codeforces Ltd. We hope you'll still be able to make profit from the market!

In the morning, there are $n$ opportunities to buy shares. The $i$-th of them allows to buy as many shares as you want, each at the price of $s_i$ bourles.

In the evening, there are $m$ opportunities to sell shares. The $i$-th of them allows to sell as many shares as you want, each at the price of $b_i$ bourles. You can't sell more shares than you have.

It's morning now and you possess $r$ bourles and no shares.

What is the maximum number of bourles you can hold after the evening?

欢迎来到 Codeforces 股票交易所！目前我们的业务范围较为有限，仅支持交易一只股票：Codeforces 公司股票。但我们相信您依然能从中获利！

早晨共有 $n$ 次购股机会。第 $i$ 次机会允许您以每股 $s_i$ 博尔（bourles）的价格购买任意数量的股票。

傍晚共有 $m$ 次售股机会。第 $i$ 次机会允许您以每股 $b_i$ 博尔（bourles）的价格出售任意数量的股票。但您出售的股票数量不能超过您当前持有的数量。

现在是早晨，您手头有 $r$ 博尔（bourles），且尚未持有任何股票。

请问：经过傍晚交易后，您最多能持有多少博尔（bourles）？

The first line of the input contains three integers $n, m, r$ ($1 \leq n \leq 30$, $1 \leq m \leq 30$, $1 \leq r \leq 1000$) — the number of ways to buy the shares on the market, the number of ways to sell the shares on the market, and the number of bourles you hold now.

The next line contains $n$ integers $s_1, s_2, \dots, s_n$ ($1 \leq s_i \leq 1000$); $s_i$ indicates the opportunity to buy shares at the price of $s_i$ bourles.

The following line contains $m$ integers $b_1, b_2, \dots, b_m$ ($1 \leq b_i \leq 1000$); $b_i$ indicates the opportunity to sell shares at the price of $b_i$ bourles.

输入的第一行包含三个整数 $n, m, r$（$1 \leq n \leq 30$，$1 \leq m \leq 30$，$1 \leq r \leq 1000$）——分别表示在市场中购买股票的方式数量、出售股票的方式数量，以及你当前持有的布尔列（bourles）数量。

接下来的一行包含 $n$ 个整数 $s_1, s_2, \dots, s_n$（$1 \leq s_i \leq 1000$）；其中 $s_i$ 表示以 $s_i$ 布尔列的价格购买股票的机会。

再下一行包含 $m$ 个整数 $b_1, b_2, \dots, b_m$（$1 \leq b_i \leq 1000$）；其中 $b_i$ 表示以 $b_i$ 布尔列的价格出售股票的机会。

Output a single integer — the maximum number of bourles you can hold after the evening.

输出一个整数——晚上结束后你最多能持有的布尔币数量。

In the first example test, you have $11$ bourles in the morning. It's optimal to buy $5$ shares of a stock at the price of $2$ bourles in the morning, and then to sell all of them at the price of $5$ bourles in the evening. It's easy to verify that you'll have $26$ bourles after the evening.

In the second example test, it's optimal not to take any action.

在第一个样例测试中，你早上有 $11$ 博尔勒斯。最优策略是在早上以每股 $2$ 博尔勒斯的价格买入 $5$ 股股票，然后在晚上以每股 $5$ 博尔勒斯的价格全部卖出。容易验证，晚上结束后你将拥有 $26$ 博尔勒斯。

在第二个样例测试中，最优策略是不进行任何操作。