### Problem name: Function

### Problem ID: 19004

### Problem setter: Vlad Dascalu

### Problem input: standard input

### Problem output: standard output

### Background:

John and Vlad meet with their friends, Nicolas and Anthony. They have choosed a number M. Also, each one of them has prepared, as previously instructed, identical sets of N labels. On each label there is a number between 1 and 1000000.

### Problem:

Each player must select a label from his owns, so that in the end, the sum of the 4 selected labels must be M.

### Input data:

On the first line there is N, the number of labels, and M, the desired sum (separated by a space). On the next N lines, the numbers from the labels will be specified.

The i-th line contains the number written on the label number i-1. So the second line will have the first number, the 3rd line the second number etc.

### Output data:

The output will include 4 numbers, separated by space, ordered from the smallest to the
biggest, indicating the IDs of the selected labels.

### Example:

#### input:

3 3420
3
8
3411

#### output:

1 1 1 3

### Restrictions:

####
- N <= 1000
- Time limit: 1 second
- Output limit: 1 MB
- Data limit: 8 MB
- Stack limit: 8 MB