#include <bits/stdc++.h>
using namespace std;
long long int mod = 1000000007;
long long int power(long long int a, long long int b) {
  if (b == 0) {
    return 1;
  } else if (b & 1) {
    return (power((a * a), b / 2) * a);
  } else {
    return (power((a * a), b / 2));
  }
}
long long int modexp(long long int x, long long int n) {
  if (n == 0) {
    return 1;
  } else if (n & 1) {
    return (modexp((x * x) % mod, n / 2) % mod * x % mod) % mod;
  } else {
    return (modexp((x * x) % mod, n / 2) % mod);
  }
}
long long int inv(long long int n) { return modexp(n, mod - 2); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    long long int l, r, m;
    cin >> l >> r >> m;
    if (l == r) {
      cout << l << " " << l << " " << l << endl;
      continue;
    }
    for (long long int a = l; a <= r; a++) {
      if (m < a) {
        long long int rem = a - m;
        if (rem > r - l) {
          continue;
        } else {
          long long int c = l + rem;
          cout << a << " " << l << " " << c << endl;
          break;
        }
        continue;
      } else {
        long long int rem1 = m % a;
        long long int rem2 = a - rem1;
        long long int rem = min(rem1, rem2);
        if (rem > r - l) {
          continue;
        } else {
          long long int c = l + rem;
          if (rem == rem1) {
            cout << a << " " << c << " " << l << endl;
          } else {
            cout << a << " " << l << " " << c << endl;
          }
          break;
        }
      }
    }
  }
  return 0;
}
