Array Fun

You are given an array $Arr$ of size $N$ and a number $M$. Create another array $Brr$ of size $M$ where $Brr[i]=$number of different ways to make sum $i$ using values in $Arr$ for all $ 1\leq i\leq M $. For example $Arr=[1,2,3]$ and $M=4$ so $Brr$ will be: $Brr[1]=1 [(1)].$ $Brr[2]=2 [(1+1),(2)].$ $Brr[3]=4 [(1+1+1),(1+2),(2+1),(3)].$ $Brr[4]=7 [(1+1+1+1),(1+1+2),(1+2+1),(2+1+1),(2+2),(1+3),(