403101: GYM101005 D Take5

Pay attention to the memory limit for this problem!

You are given an array A of size N and a positive integer S. You need to find the number of ways W in which you can chose 5 elements with distinct positions such that their sum is equal to S.

The first line contains two positive integer N,  S (1 ≤ N ≤ 10³,  0 ≤ S ≤ 2 * 10⁹) - the size of the array and the queried sum.

The next line contains N numbers A_i (0 ≤ A_i ≤ 4 * 10⁸,  1 ≤ i ≤ N).

Print the only integer W (0 ≤ W < 2³¹) - the number of ways to chose the elements.

6 5
1 1 1 1 1 1

6