We will do it in the recitation… there are similar questions in previous exams if you want to prepare….
Start with "there is a set of N integers whose value is bounded by M (i.e. between 1 and N). Use dynamic programming to find whether there is a subset of them whose sum is X."