CF1476B.Inflation

You have a statistic of price changes for one product represented as an array of $n$ positive integers $p_0, p_1, \dots, p_{n - 1}$, where $p_0$ is the initial price of the product and $p_i$ is how the price was increased during the $i$-th month.

Using these price changes you are asked to calculate the inflation coefficients for each month as the ratio of current price increase $p_i$ to the price at the start of this month $(p_0 + p_1 + \dots + p_{i - 1})$.

Your boss said you clearly that the inflation coefficients must not exceed $k$ %, so you decided to increase some values $p_i$ in such a way, that all $p_i$ remain integers and the inflation coefficients for each month don't exceed $k$ %.

You know, that the bigger changes — the more obvious cheating. That's why you need to minimize the total sum of changes.

What's the minimum total sum of changes you need to make all inflation coefficients not more than $k$ %?

你拥有一组表示某商品价格变化的统计数据，其形式为一个包含 $n$ 个正整数的数组 $p_0, p_1, \dots, p_{n - 1}$，其中 $p_0$ 是该商品的初始价格，$p_i$ 表示第 $i$ 个月的价格上涨额。

利用这些价格变化数据，你需要计算每个月的通货膨胀系数，其定义为当月价格上涨额 $p_i$ 与当月月初价格（即 $p_0 + p_1 + \dots + p_{i - 1}$）的比值。

你的老板明确要求：所有月份的通货膨胀系数不得超过 $k$ %。因此，你决定对部分 $p_i$ 的值进行增加（所有 $p_i$ 必须保持为整数），使得每月的通货膨胀系数均不超过 $k$ %。

你知道：改动幅度越大，作弊行为越明显。因此，你需要最小化所有改动量的总和。

为使所有通货膨胀系数均不超过 $k$ %，所需的最小总改动量是多少？

The first line contains a single integer $t$ ($1 \le t \le 1000$) — the number of test cases.

The first line of each test case contains two integers $n$ and $k$ ($2 \le n \le 100$; $1 \le k \le 100$) — the length of array $p$ and coefficient $k$.

The second line of each test case contains $n$ integers $p_0, p_1, \dots, p_{n - 1}$ ($1 \le p_i \le 10^9$) — the array $p$.

第一行包含一个整数 $t$（$1 \le t \le 1000$）—— 测试用例的数量。

每个测试用例的第一行包含两个整数 $n$ 和 $k$（$2 \le n \le 100$；$1 \le k \le 100$）—— 数组 $p$ 的长度和系数 $k$。

每个测试用例的第二行包含 $n$ 个整数 $p_0, p_1, \dots, p_{n - 1}$（$1 \le p_i \le 10^9$）—— 数组 $p$。

For each test case, print the minimum total sum of changes you need to make all inflation coefficients not more than $k$ %.

对于每个测试用例，输出使所有通货膨胀系数均不超过 $k$ % 所需的最小总调整量。

In the first test case, you can, for example, increase $p_0$ by $50$ and $p_1$ by $49$ and get array $[20150, 50, 202, 202]$. Then you get the next inflation coefficients:

1. $\frac{50}{20150} \le \frac{1}{100}$;
2. $\frac{202}{20150 + 50} \le \frac{1}{100}$;
3. $\frac{202}{20200 + 202} \le \frac{1}{100}$;

In the second test case, you don't need to modify array $p$, since the inflation coefficients are already good:

1. $\frac{1}{1} \le \frac{100}{100}$;
2. $\frac{1}{1 + 1} \le \frac{100}{100}$;

在第一个测试用例中，例如，你可以将 $p_0$ 增加 $50$，将 $p_1$ 增加 $49$，从而得到数组 $[20150, 50, 202, 202]$。此时可得如下通货膨胀系数：

1. $\frac{50}{20150} \le \frac{1}{100}$；
2. $\frac{202}{20150 + 50} \le \frac{1}{100}$；
3. $\frac{202}{20200 + 202} \le \frac{1}{100}$；

在第二个测试用例中，无需修改数组 $p$，因为当前的通货膨胀系数已满足要求：

1. $\frac{1}{1} \le \frac{100}{100}$；
2. $\frac{1}{1 + 1} \le \frac{100}{100}$；