#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define nl cout<<"\n";
#define sp cout<<" ";
#define sz(x) x.size()
#define NumOfDigit(w) log10(w) + 1
#define fill(arr, val)  memset(arr, val , sizeof(arr))
#define PI 3.141592654
#define ceil(w, m) (((w) / (m)) + ((w) % (m) ? 1 : 0))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define fi first
#define se second
#define cin(v) for (auto&i:v) cin >> i;
#define cout(v) for (auto&i:v) cout << i << " ";
#define fixed(n) fixed << setprecision(n)
#define MOD (ll) 1e9 + 7;
using namespace std;

void zainab_hamdy(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    //freopen("filename.in" , "r" ,stdin);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}
/*bool prime(ll n){
    if(n==2 || n==3) return true;
    if(n<2 || n%2==0  ) return false;
    for(int i=3;i<=sqrt(n);i+=2)   if(n%i==0) return false;
    return true;
}*/


void isAccepted(){

ll n ,q ; cin >> q >>  n ;

vector <ll > ans ;
for(ll i=pow(2,n-1)+1 ; i<=pow(10,n)-1 ; i++){
    string t, s =to_string(i);
    t=s;
    reverse(all(s));
    if(s==t and sz(s)==n)
        ans.push_back(i);
        if(sz(s) > n ) break;

}
//cout (ans);
int tmp;
while(q--){
    cin >> tmp;
    if (tmp>sz(ans)) cout <<"-1\n";
    else cout << ans[tmp-1] <<"\n";
}
}
int main(){
                zainab_hamdy();

    int testCase=1;  // one test case
   // cin >> testCase;
    while(testCase--)
        isAccepted();  // my code

    return 0;
}