As soon as SWERC starts, your experienced (3)-person team immediately realizes that the contest features (a) easy problems, (b) medium problems, and (c) hard problems. Solving a problem will take any of you (2), (3), or (4) time units, depending on whether the problem is easy, medium, or hard. Regardless of the difficulty of the problem, the last time unit spent to solve it has to be spent using your shared computer. You organize your efforts so that each of you starts (and ends) solving problems at integer time units. Any given problem can be solved by only one contestant; it requires a contiguous amount of time (which depends on the difficulty of the problem). None of the (3) of you can solve more than one problem at a time, but you can start solving a new problem immediately after finishing one. Similarly, the shared computer cannot be used by more than one of you at a time, but any of you can start using the computer (to complete the problem currently being solved) immediately after someone else stops using it. Given that the contest lasts (l) time units, find the maximum number of problems that your team can solve. Additionally, find one way to solve the maximum number of problems. The input has a single line. It contains four integers (a), (b), (c), (l) ((0 \leq a, b, c, \leq 10^4), (0 \le l \le 10^5)) — the number of easy, medium, and hard problems, and the duration of the contest. On the first line, print a single integer (n) — the maximum number of problems that your team can solve. Then, on the (j)-th of the following (n) lines, print three integers (x_j), (p_j), (q_j) ((1 \leq x \leq 3), (0 \leq p_j < q_j \leq l)) — the contestant that solves the (j)-th problem, and the start and end time for solving the (j)-th problem (measured as time units elapsed from the beginning of the contest). The difference (q_j - p_j) is (2), (3), or (4)