def csubset_sum(arr,sum,n):
    t = [0]*(n+1)
    for i in range(n+1):
        t[i] = [0]*(sum+1)
    for i in range(n+1):
        t[i][0] = 1 
    for i in range(1, n+1):
        for j in range(1, sum+1):
            if arr[i-1] <= j:
                t[i][j] = t[i-1][j-arr[i-1]] + t[i-1][j]
            else:
                t[i][j] = t[i-1][j]

    return t[n][sum]
    

arr= [8,2,4,6]
sum = 2
n = len(arr)
print(csubset_sum(arr,sum,n))
