CF寒假补题集——B. Banknotes

In Berland, nn different types of banknotes are used. Banknotes of the ii-th type have denomination 10ai10ai burles (burles are the currency used in Berland); the denomination of banknotes of the first type is exactly 11.

Let's denote f(s)f(s) as the minimum number of banknotes required to represent exactly ss burles. For example, if the denominations of banknotes used in Berland are 11, 1010 and 100100, then f(59)=14f(59)=14: 99 banknotes with denomination of 11 burle and 55 banknotes with denomination of 1010 burles can be used to represent exactly 9⋅1+5⋅10=599⋅1+5⋅10=59 burles, and there's no way to do it with fewer banknotes.

For a given integer kk, find the minimum positive number of burles ss that cannot be represented with kk or fewer banknotes (that is, f(s)>kf(s)>k).

Input

The first line contains a single integer tt (1≤t≤1041≤t≤104) — number of test cases.

The first line of each test case contains two integers nn and kk (1≤n≤10;1≤k≤1091≤n≤10;1≤k≤109).

The next line contains nn integers a1,a2,…,ana1,a2,…,an (0=a1<a2<⋯<an≤90=a1<a2<⋯<an≤9).

Output

For each test case, print one integer — the minimum positive number of burles ss that cannot be represented with kk or fewer banknotes.

Example

input

Copy

4
3 13
0 1 2
2 777
0 4
3 255
0 1 3
10 1000000000
0 1 2 3 4 5 6 7 8 9

output

Copy

59
778
148999
999999920999999999

题目目标：获得最大可以表示的金额；

题目解析：给出不同面值的纸币，和可用纸币的数量，求可以携带的金额数，要求尽可能用 面值较大的纸币；

解题思路：

所给总张数要加1

        先读入面值，再计算出当前这个面值到下个面值在不进位的情况下最大可以取到的张数，并记录在c数组中，再从小到大遍历所有面值，在不超出张数要求下将

当前面值的最大可取张数*当前面值，同时总张数-当前面值张数，最后将剩余张数与下一个面值相乘

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1000;

ll a[N],b[N], c[N];

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        ll ans = 0;
        int n, k;
        cin>>n>>k;
        int cnt = 1;
        for(int i = 1; i<=n; ++i)
        {
            cin>>a[i];
            b[i] = pow(10,a[i]);
            if(i > 1)
            {
                c[i-1] = (b[i]/b[i-1])-1;
            }
            if(k >= c[cnt] && cnt<n && i>1)
            {
                 k -= c[cnt];
                 ans += c[cnt]*b[cnt];
                 cnt++;
            }
        }
        ans += (k+1)*b[cnt];
        cout<<ans<<endl;
        memset(a,0,sizeof a);
        memset(b,0,sizeof b);
        memset(c,0,sizeof c);
    }
    return 0;
}