# Combination Sum IV

Posted: 15 Jan, 2022
Difficulty: Moderate

## PROBLEM STATEMENT

#### But if way1 =[1,2,3,4] and way2= [4,3,2,1] then both ways are different.

##### For Example:
``````If N = 3 and tar = 5 and array elements are [1,2,5] then the number of possible ways of making sum = 5 are:
(1,1,1,1,1)
(1,1,1,2)
(1,2,1,1)
(2,1,1,1)
(1,1,2,1)
(2,2,1)
(1,2,2)
(2,1,2)
(5)
Hence the output will be 9.
``````
##### Input Format :
``````The first line of the input contains an integer, 'T’, denoting the number of test cases.

The first line of each test case will contain two space-separated integers ‘N’ and “tar”, denoting the size of the array and the given integer.

The second line of each test case contains ‘N’ space-separated integers denoting elements of the array.
``````
##### Output Format :
``````For each test case, print the number of ways that satisfy the condition mentioned in the problem statement.

Print a separate line for each test case.
``````
##### Note :
``````You do not need to print anything, it has already been taken care of. Just implement the given function.
``````
##### Constraints:
``````1 <= N <= 200
1 <= nums[i] <= 1000
All the elements will be unique
1 <= tar <= 1000

Time limit: 1 sec
``````