A common programming contest format includes teams with three contestants working to solve the maximum amount of programming challenges in the less amount of time using a single computer. Some contests have been created using a similar idea. In this contest a team has $$$T$$$ team members, each team member has an energy $$$E_i$$$. The higher the energy of the member the more and the harder problems he can solve. There are a total of $$$P$$$ programming challenges, to be solved, using a single computer. The programming challenges are numbered with numbers from $$$1$$$ to $$$P$$$, each one having a difficulty of $$$D_i$$$ and a score value of $$$S_i$$$.

The contest runs as follows, the first team member will sit in front of the computer and then the contest will start , then the first problem will be shown to him, he has to decide either to solve the problem, to do not solve it and go try the next one, or to stop solving problems. A team member can solve a problem if and only if it's remaining energy is grater or equal to the problem difficulty. Once the team member decides to stop solving problems, he can not solve problems again and the next team member will sit in front of the computer and start with the problem the previous team member left. If the team member $$$i$$$ solves problem $$$j$$$, then it will take $$$D_j$$$ from his $$$E_i$$$ energy and score $$$S_j$$$ points to the team. If a team member decides to not solve a problem and go to the next one, no other member in the team can go back to solve it. The contest ends for the team when either there are no more problems to solve, or there are no team members left to work on the remaining problems.

For this particular problem your task is, given the energy of each team member, the difficulty and score of the problems in a contest, determine in what order the team members should solve the problems so the team can score their maximum possible score.