#include <bits/stdc++.h>
using namespace std;
bool comp(int m, int key, vector<int>& a) { return a[m] <= key; }
int binsear(vector<int>& a, int key, int l, int r) {
  while (l < r) {
    int m = (l + r) / 2;
    if (comp(m, key, a)) {
      l = m + 1;
    } else {
      r = m;
    }
  }
  return l;
}
int main() {
  int tt;
  cin >> tt;
  while (tt--) {
    vector<int> mas;
    long long a, b, c, d;
    cin >> a >> b >> c >> d;
    long long x, y, z;
    x = b;
    y = (b + c) / 2;
    z = c;
    if (x + y <= z) {
      y = z;
    }
    cout << x << " " << y << " " << z << endl;
  }
  return 0;
}
