Problem: Polycarp is in really serious trouble — his house is on fire! It's time to save the most valuable items. Polycarp estimated that it would take ti seconds to save i-th item. In addition, for each item, he estimated the value of di — the moment after which the item i will be completely burned and will no longer be valuable for him at all. In particular, if ti ≥ di, then i-th item cannot be saved.

Given the values pi for each of the items, find a set of items that Polycarp can save such that the total value of this items is maximum possible. Polycarp saves the items one after another. For example, if he takes item a first, and then item b, then the item a will be saved in ta seconds, and the item b — in ta + tb seconds after fire started.

Input

The first line contains a single integer n (1 ≤ n ≤ 100) — the number of items in Polycarp's house.

Each of the following n lines contains three integers ti, di, pi (1 ≤ ti ≤ 20, 1 ≤ di ≤ 2 000, 1 ≤ pi ≤ 20) — the time needed to save the item i, the time after which the item i will burn completely and the value of item i.

Output

In the first line print the maximum possible total value of the set of saved items. In the second line print one integer m — the number of items in the desired set. In the third line print m distinct integers — numbers of the saved items in the order Polycarp saves them. Items are 1-indexed in the same order in which they appear in the input. If there are several answers, print any of them.

Examples

Input

3
3 7 4
2 6 5
3 7 6


Output

11
2
2 3 


Input

2
5 6 1
3 3 5


Output

1
1
1 

Note

In the first example Polycarp will have time to save any two items, but in order to maximize the total value of the saved items, he must save the second and the third item. For example, he can firstly save the third item in 3 seconds, and then save the second item in another 2 seconds. Thus, the total value of the saved items will be 6 + 5 = 11.

In the second example Polycarp can save only the first item, since even if he immediately starts saving the second item, he can save it in 3 seconds, but this item will already be completely burned by this time.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
struct node {
  int t, d, p, pos;
} a[20000];
struct nod {
  int anss, ti;
} an[20000];
using namespace std;
int dp[20000], ansx, k1[20000], k2[20000], k3[20000];
int a1[2010][110];
bool cmp(node x, node y) { return x.d < y.d; }
void dfs(int ti) {
  if (ti <= 0) return;
  an[++ansx].anss = k1[ti];
  an[ansx].ti = ti;
  dfs(k2[ti]);
}
bool cmp1(nod x, nod y) { return x.ti < y.ti; }
int main() {
  int n;
  scanf("%d", &n);
  int maxt = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d%d%d", &a[i].t, &a[i].d, &a[i].p);
    a[i].pos = i;
    maxt = max(maxt, a[i].d);
  }
  sort(a + 1, a + 1 + n, cmp);
  dp[0] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = a[i].d - 1; j >= a[i].t; j--) {
      if (dp[j - a[i].t] + a[i].p > dp[j]) {
        dp[j] = dp[j - a[i].t] + a[i].p;
        for (int ii = 1; ii <= k3[j]; ii++) a1[j][ii] = 0;
        for (int ii = 1; ii <= k3[j - a[i].t]; ii++)
          a1[j][ii] = a1[j - a[i].t][ii];
        k1[j] = i;
        k3[j] = k3[j - a[i].t] + 1;
        a1[j][k3[j]] = i;
      }
    }
  }
  int ans = 0;
  for (int i = 0; i <= maxt; i++) ans = max(ans, dp[i]);
  int ansx = 0, p1 = 0;
  printf("%d\n", ans);
  for (int i = 0; i <= maxt; i++) {
    if (dp[i] == ans) {
      p1 = i;
      break;
    }
  }
  printf("%d\n", k3[p1]);
  for (int i = 1; i <= k3[p1]; i++) printf("%d ", a[a1[p1][i]].pos);
  return 0;
}