The Number of Ways to Make the Sum

Given a target sum and a list of positive integers (e.g., coin values), count how many distinct ways to form that sum under the problem's rules about reuse and order; this is a counting/knapsack DP problem where you build states for partial sums and usually handle large counts with modulus arithmetic.