#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using i3 = pair<int, ii>;
using li = pair<ll, int>;
using lii = pair<ll, ii>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<ii>;
using vli = vector<li>;
using vpll = vector<pll>;
using vi3 = vector<i3>;
using vlii = vector<lii>;
const int N = 2e5 + 5;
const ll INF = 1e17 + 7;
const double eps = 1e-9, PI = acos(-1);
int a, b, c;
int A, B, C;
int mnCost;
void fuck(int i, int j, int k) {
  int cost = abs(a - i) + abs(b - j) + abs(c - k);
  if (cost < mnCost) {
    mnCost = cost;
    A = i;
    B = j;
    C = k;
  }
}
void solve(int testCase) {
  scanf("%d %d %d", &a, &b, &c);
  mnCost = 2e9;
  for (int i = 1; i <= 2 * a; i++) {
    for (int j = i; j <= 2 * b; j += i) {
      if (c >= j) fuck(i, j, c / j * j);
      fuck(i, j, c / j * j + j);
    }
  }
  printf("%d\n%d %d %d\n", mnCost, A, B, C);
}
int main() {
  int t = 1;
  scanf("%d", &t);
  for (int testCase = 1; testCase <= t; testCase++) {
    solve(testCase);
  }
  return 0;
}
