#include <bits/stdc++.h>
const long long mod = 1000000000 + 7;
const long long INF = 9000000000000000000;
using namespace std;
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long lcm(long long a, long long b) { return (a * b / (gcd(a, b))); }
long long go(long long n, long long l, long long r) {
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      if (i >= l && i <= r) return i;
      if ((n / i) >= l && (n / i) <= r) return (n / i);
    }
  }
  return -1;
}
void solve() {
  long long l, r, m;
  cin >> l >> r >> m;
  long long low = (m - (r - l)) > 0 ? m - (r - l) : 0;
  long long high = m + (r - l);
  if (low == high) {
    cout << l << " " << l << " " << l << endl;
    return;
  }
  if (low >= l && low <= r) {
    cout << low << " " << r << " " << l << endl;
  } else if (high >= l && high <= r) {
    cout << high << " " << l << " " << r << endl;
  } else {
    for (long long i = l; i <= r; i++) {
      if ((low / i) != (high / i)) {
        long long x = low / i * i;
        if (x < low) x += i;
        long long xb, xc;
        if (x > m) {
          xc = l + x - m;
          xb = l;
        } else {
          xb = l + m - x;
          xc = l;
        }
        cout << i << " " << xb << " " << xc << endl;
        break;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  long long tests = 1;
  cin >> tests;
  while (tests--) {
    solve();
  }
  return 0;
}
