#include<bits/stdc++.h>
#define ll long long
#define db double
#define ull unsigned long long
#define eb emplace_back
#define mp make_pair
#define pii pair<int, int>
#define FR first
#define SE second
#define int long long
using namespace std;
inline int read() {
  int x = 0; bool op = false;
  char c = getchar();
  while(!isdigit(c))op |= (c == '-'), c = getchar();
  while(isdigit(c))x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return op ? -x : x;
}
const int N = 1e5 + 10;
int n;
int a[N], b[N], c[N];
void solve() {
  n = read();
  vector<int> A, B;
  for(int i = 1; i <= n; i++) {
    a[i] = read(); b[i] = read(); c[i] = read();
    (a[i] < b[i] ? A : B).eb(i);
  }
  int lef = 0, rig = 1e12;
  auto chk = [&](int X) {
    sort(A.begin(), A.end(), [&](int x, int y) {return X / c[x] - a[x] > X / c[y] - a[y];});
    int sum = 0;
    for(int i = 1; i <= n; i++)sum += b[i];
    for(int x : A) {
      if(sum + a[x] > X / c[x])return false;
      sum -= b[x]; sum += a[x];
    }
    sum = 0;
    for(int i = 1; i <= n; i++)sum += a[i];
    sort(B.begin(), B.end(), [&](int x, int y) {return X / c[x] - b[x] > X / c[y] - b[y];});
    for(int x : B) {
      if(sum + b[x] > X / c[x])return false;
      sum -= a[x]; sum += b[x];
    }
    return true;
  };
  while(lef + 1 < rig) {
    int mid = lef + rig >> 1;
    if(chk(mid))rig = mid;
    else lef = mid;
  }
  cout << rig << endl;
  reverse(B.begin(), B.end());
  A.insert(A.end(), B.begin(), B.end());
  for(int x : A)printf("%lld ", x); putchar('\n');
  return ;
}
signed main() {
  int test = read();
  while(test--)solve();
  return 0;
}