#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long l, r, m, n;
  cin >> l >> r >> m;
  long long minimum = l - r, maximum = r - l;
  long long m1 = m - maximum, m2 = m - minimum;
  while (true) {
    n = m2 / l;
    if (n * l >= m1) {
      long long b = r;
      long long c = n * l + r - m;
      if (c > r) {
        b -= c - r;
        c -= c - r;
      }
      cout << l << ' ' << b << ' ' << c << ' ' << endl;
      return;
    }
    ++l;
  }
}
int main() {
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
