#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 3;
const long long inf = 1e5 + 3;
const long long ninf = -1e9;
const long long mod = 1e9 + 7;
void solve() {
  long long l, r, m;
  cin >> l >> r >> m;
  long long y = r - l, x = l - r;
  long long a, b, c, d, z, g;
  for (long long i = l; i <= r; i++) {
    d = m % i;
    z = m / i;
    g = i - d;
    if (z >= 1) {
      if (d >= x && d <= y) {
        a = i;
        b = r;
        c = r - d;
        break;
      } else if ((-1LL * g) >= x && (-1LL * g) <= y) {
        a = i;
        b = l;
        c = l + g;
        break;
      }
    } else if (z == 0 && (-1LL * g) >= x && (-1LL * g) <= y) {
      a = i;
      b = l;
      c = l + g;
      break;
    }
  }
  cout << a << " " << b << " " << c << "\n";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long T = 1;
  cin >> T;
  while (T--) {
    solve();
  }
  return 0;
}
