#include <algorithm>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using std::cout;
using std::cin;
using std::endl;
using std::max;
using std::min;
using std::sort;
using std::swap;
using std::greater;
using std::numeric_limits;
using std::memset;
using std::deque;
using std::list;
using std::queue;
using std::stack;
using std::string;
using std::vector;
using std::pair;
using std::make_pair;
using std::fill;

// type definitions


// global variables
int const INF = numeric_limits<int>::max();
bool was_checked[10000]; // [r] r: remainder
string g;
unsigned long long n, m;
unsigned long long digits[10];
unsigned long long digit_len;


// function declarations
void solve();


int main() {
  int test_case;
  cin >> test_case;
  for ( int i = 0; i < test_case; i++ ) {
    solve();
  }

  return 0;
}


void solve() {
  // Initialization
  cin >> g >> n >> m;
  digit_len = g.length();
  fill(was_checked, was_checked + 10000, false);
  for ( int i = 0; i < digit_len; i++ ) {
    digits[i] = g[i] - '0';
  }
  sort(digits, digits + digit_len);

  // Solve
  queue<string> candidates;
  queue<unsigned long long> remainders;
  queue<unsigned long long> seed;

  for ( int i = 0; i < digit_len; i++ ) {
    if ( digits[i] != 0 ) {
      candidates.push(g.substr(i, 1));
      remainders.push((digits[i] + n - m) % n);
      seed.push(digits[i]);
    }
  }

  while ( seed.front() < n + m ) {
    string cur = candidates.front();
    unsigned long long r = remainders.front();
    unsigned long long v = seed.front();
    candidates.pop(); remainders.pop(); seed.pop();

    for ( int i = 0; i < digit_len; i++ ) {
      unsigned long long c = digits[i];
      string new_candidate = cur + g.substr(i, 1);
      unsigned long long new_v = 10 * v + c;
      unsigned long long new_r = (10 * r + 9 * m + c) % n;
      candidates.push(new_candidate);
      remainders.push(new_r);
      seed.push(new_v);
    }
  }

  while ( !candidates.empty() ) {
    string cur = candidates.front();
    unsigned long long r = remainders.front();
    candidates.pop(); remainders.pop();
    if ( r == 0 ) {
      cout << cur << endl;
      return;
    }
    was_checked[r] = true;

    for ( int i = 0; i < digit_len; i++ ) {
      unsigned long long c = digits[i];
      unsigned long long new_r = (10 * r + 9 * m + c) % n;
      if ( was_checked[new_r] ) continue;
      string new_candidate = cur + g.substr(i, 1);
      candidates.push(new_candidate);
      remainders.push(new_r);
    }
  }

  cout << "IMPOSSIBLE" << endl;

  // Ending
}