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 JAVA):

Solution:
//package test;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
public final class Main {
	
	static ArrayList<Integer> res = new ArrayList<Integer>();
	static int n;
	static pair arr[] = new pair[101];
	static node dp[][] = new node[101][2005];
	public static void main(String args[]) {
		
		InputReader ir = new InputReader(System.in);
		PrintWriter w = new PrintWriter(System.out);
		int i;
		n = ir.nextInt();
		for(i=1 ; i<=n ; i++) {
			arr[i] = new pair();	
			arr[i].t = ir.nextInt();
			arr[i].d = ir.nextInt();
			arr[i].p = ir.nextInt();
			arr[i].i = i;
		}
		Arrays.sort(arr,1,n+1,new SortPair());
		/*for(i=1 ; i<=n ; i++)
			w.println(arr[i].d);*/
		node res = solve(1,0,0);
		w.println(res.pr);
		w.println(res.list.size());
		for(int ii : res.list) {
			w.print(ii + " ");
		}
		w.println();
		w.close();
	}
	
	static node solve(int i,int tm, int pr) {
		
		//System.out.println(i);
		if(i == n+1) {
			return null;
		}
		if(dp[i][tm] != null)
			return dp[i][tm];
		node tmp1 = null;
		node tmp3 = null;
		if(tm + arr[i].t < arr[i].d) {
			//set.add(i);
			tmp1 = new node();
			tmp1.pr += arr[i].p;
			tmp1.list.add(arr[i].i);
			tmp3 = solve( i+1, tm+arr[i].t, pr+arr[i].p);
			//set.remove(i);
		}
		if(tmp3 != null) {
			tmp1.pr += tmp3.pr;
			for(int ii : tmp3.list)
				tmp1.list.add(ii);
		}
		node tmp2 = solve( i+1, tm, pr);
		node ttt = new node();
		if(tmp1 != null && tmp2 != null) {
			
			if(tmp1.pr > tmp2.pr) {
				ttt.pr += tmp1.pr;
				for(int ii : tmp1.list) {
					ttt.list.add(ii);
				}
				
			}else {
				ttt.pr += tmp2.pr;
				for(int ii : tmp2.list) {
					ttt.list.add(ii);
				}
			}	
		}else if(tmp1 != null) {
			ttt.pr += tmp1.pr;
			for(int ii : tmp1.list) {
				ttt.list.add(ii);
			}
		}else if(tmp2 != null) {
			ttt.pr += tmp2.pr;
			for(int ii : tmp2.list) {
				ttt.list.add(ii);
			}
		}
		dp[i][tm] = ttt;
		return dp[i][tm];
	}
	static class pair{
		
		int t,d,p,i;
		
	}
	static class node{
		
		ArrayList<Integer>list;
		int pr;
		node(){
			list = new ArrayList<Integer>();
			pr = 0;
		}
	}
	/*
	 5
	1 1 1
	2 3 5
	3 6 100
	4 4 4
	2 3 200
	 */
	static class SortPair implements Comparator<pair>{
		public int compare(pair a,pair b) {
			return a.d - b.d;
		}
	}
	static class InputReader {
		 
        private final InputStream stream;
        private final byte[] buf = new byte[8192];
        private int curChar, snumChars;
        private SpaceCharFilter filter;
 
        public InputReader(InputStream stream) {
            this.stream = stream;
        }
 
        public int snext() {
            if (snumChars == -1)
                throw new InputMismatchException();
            if (curChar >= snumChars) {
                curChar = 0;
                try {
                    snumChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (snumChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }
 
        public int nextInt() {
            int c = snext();
            while (isSpaceChar(c)) {
                c = snext();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = snext();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = snext();
            } while (!isSpaceChar(c));
            return res * sgn;
        }
 
        public long nextLong() {
            int c = snext();
            while (isSpaceChar(c)) {
                c = snext();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = snext();
            }
            long res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = snext();
            } while (!isSpaceChar(c));
            return res * sgn;
        }
 
        public int[] nextIntArray(int n) {
            int a[] = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = nextInt();
            }
            return a;
        }
 
        public String readString() {
            int c = snext();
            while (isSpaceChar(c)) {
                c = snext();
            }
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = snext();
            } while (!isSpaceChar(c));
            return res.toString();
        }
 
        public String nextLine() {
            int c = snext();
            while (isSpaceChar(c))
                c = snext();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = snext();
            } while (!isEndOfLine(c));
            return res.toString();
        }
 
        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }
 
        private boolean isEndOfLine(int c) {
            return c == '\n' || c == '\r' || c == -1;
        }
 
        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    }
}