#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
  ll l, r, m;
  cin >> l >> r >> m;
  for (ll a = l; a <= r; ++a) {
    ll mod = m % a;
    if (m >= a && mod <= r - l) {
      cout << a << ' ' << r << ' ' << r - mod << endl;
      return;
    } else if (mod - a >= l - r) {
      cout << a << ' ' << l << ' ' << l + a - mod << endl;
      return;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
