Harsh loves playing with numbers. On his birthday, he is given an array and a target value. Being curious, he wishes to know how many ways can he reach the target value using each element just once. Now he knows that unless he knows that answer, he will be restless. You are his best friend and thus, he has approached you to solve this problem gor him. Help him now!

Input Format
The first line contains 2 integers, N and T. The next line contains N space separated integers.

Output Format
The output consists of just 1 integer, i.e. the number of ways in which the target value, T, can be reached.

Constraints
$1 \le N \le 100$
$1 \le arr[i] \le 50$
$1 \le T \le 50$