#include <bits/stdc++.h>
using namespace std;
long long l, r, m, a, b, c;
long long vis[500050];
inline void solve() {
  memset(vis, 0, sizeof vis);
  scanf("%lld%lld%lld", &l, &r, &m);
  long long d = r - l;
  for (long long i = l; i <= r; i++) {
    if (vis[i]) continue;
    long long tm = m - i;
    if (tm < 0) {
      if (d + tm >= 0) {
        printf("%lld %lld %lld\n", i, l, l - tm);
        return;
      }
    } else {
      long long tmp1 = tm % i;
      long long tmp2 = i - tmp1;
      if (tmp1 <= d) {
        printf("%lld %lld %lld\n", i, l + tmp1, l);
        return;
      }
      if (tmp2 <= d) {
        printf("%lld %lld %lld\n", i, l, l + tmp2);
        return;
      }
    }
  }
}
int main() {
  int T;
  scanf("%d", &T);
  for (int t = 1; t <= T; t++) {
    solve();
  }
  return 0;
}
