#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

#define QUESIZE 100000

using namespace std;

int Tt, Nn, Mm;
string Dd;
vector<int> nums;
vector<long long int> que;
bool isFind;
int cache[10001];
int head;

void INITCACHE() {
    for (int i = 0; i < 10001; i++)
        cache[i] = -1;
    nums.clear();
    que.clear();
    head = 0;
    que.resize(QUESIZE);
    nums.reserve(10);
}

void BFS(long long int num) {

    int namugi = num%Nn;

    if (namugi == Mm && num >= Nn) {
        cout << num << endl;
        isFind = true;
        return;
    }

    if (cache[namugi] != -1)
        return;

    cache[namugi] = 1;

    for (int i = 0; i < nums.size(); i++) {
        que[head] = num * 10 + nums[i];
        head = (head + 1) % QUESIZE;
    }
}

int main() {

    cin >> Tt;
    for (int ti = 0; ti < Tt; ti++) {
        INITCACHE();
        cin >> Dd >> Nn >> Mm;
        for (int i = 0; i < Dd.size(); i++) {
            int temp = Dd[i] - 48;
            nums.push_back(temp);
        }
        sort(nums.begin(), nums.end());

        que[head] = 0;
        head = (head + 1) % QUESIZE;

        int qIndex = 0;
        isFind = false;
        while (qIndex != head && !isFind) {
            BFS(que[qIndex]);
            qIndex = (qIndex + 1) % QUESIZE;
        }

        if (!isFind)
            cout << "IMPOSSIBLE" << endl;
    }
}