/*
 * File:   main.cpp
 * Author: khaled
 *
 * Created on September 19, 2014, 3:32 PM
 */

#include<iostream>
#include<fstream>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<iomanip>
#include<bitset>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<cmath>
#include<functional>

#define ll long long
#define ull unsigned long long
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep2(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define vll vector<long long>
#define vi vector<int>
#define pb(i) push_back( i )
#define ii pair<int,int>
#define vii vector <pair<int,int> >
#define mp(i,j) (make_pair ( i , j ))
#define dwiln(x) printf("%d\n",(x))
#define dri(x) scanf("%d",&(x))
#define drii(x,y) scanf("%d%d",&(x),&(y))
#define drl(x) scanf("%I64d",&(x))
#define drll(x,y) scanf("%I64d%I64d",&(x),&(y))
#define setbit(x,i) (x|(1<<i))
#define getbit(x,i) ((x>>i)&1)
using namespace std;
int Tc;
int r, q;
string n;
vector<string> v;
vector<pair<int, string> > v2;

bool lesss(const string& a, const string& b) {
    if (a.size() == b.size()) {
        return a<b;

    }
    return a.size() < b.size() + 1;
}

bool lesss(const string& a, const string& b, int i) {
    if (a.size() == b.size() + 1) {
        if (a.find(b) == 0)
            return a[a.size() - 1] < i + '0';
        return a<b;

    }
    return a.size() < b.size() + 1;
}

int main() {
    freopen("identify.in", "r", stdin);
    freopen("identify.out", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin>>Tc;
    while (Tc--) {
        cin >> n >> r>>q;
        v.clear();
        v.resize(q, "");
        for (int i = 0; i < n.size(); i++) {
            int t = n[i] - '0';
            v2.clear();
            for (int j = 0; j < q; j++) {
                string &tmp = v[j];
                if (v[j] == "" && j != 0)
                    continue;
                int newj = (j * 10 + t) % q;
                if (tmp != "" || t != 0) {
                    if (lesss(v[newj], tmp,t))
                        //   if(tmp>v[newj])
                        v2.push_back(make_pair(newj, tmp+char('0'+t)));
                } else {

                }
            }
            for (int i = 0; i < v2.size(); i++) {
                //if( v[v2[i].first]<v2[i].second)
                if (lesss(v[v2[i].first], v2[i].second))
                    v[v2[i].first] = v2[i].second;

            }


        }
        if (v[r] == "")
            cout << "Not found\n";
        else
            cout << v[r] << "\n";

    }
   // cout<<"ddd";
    return 0;
}