#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const long long linf = 2e18;
const long long mod = 1e9 + 7;
template <typename T>
ostream& operator<<(ostream& s, vector<T>& v) {
  for (auto el : v) {
    s << el << " ";
  }
  return s;
}
long long mx, mn;
long long find1(long long a) {
  long long l = 0, r = 1e11;
  while (r - l > 1) {
    long long c = (r + l) / 2;
    if (c * a <= mx)
      l = c;
    else
      r = c;
  }
  return l;
}
long long find2(long long a) {
  long long l = 0, r = 1e10;
  while (r - l > 1) {
    long long c = (r + l) / 2;
    if (c * a >= mn)
      r = c;
    else
      l = c;
  }
  return r;
}
void solve() {
  long long l, r, m;
  cin >> l >> r >> m;
  mx = m + r - l;
  mn = m + l - r;
  for (long long a = l; a <= r; a++) {
    long long nmx = find1(a);
    long long nmn = find2(a);
    if (nmx < nmn) continue;
    long long dif = m - nmx * a;
    for (long long b = l; b <= r; b++) {
      long long c = b - dif;
      if (l <= c && c <= r) {
        cout << a << " " << b << " " << c << endl;
        return;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
