I can't think of a DP for this task help plz Find the number of sequences (a1, a2,..., an) such that a[i]^2 + a[i + 1]^2 + ... + a[n]^2 = k a[i] <= a[i + 1] <= ... <= a[n]

T is testcase n is quantity of number k is a[i]^2 + a[i + 1]^2 + ... + a[n]^2 = k

1 <= T <= 1e5 1 <= n <= 100 1 <= k <= 5000 example input 1 4 243 output 9

Explanation 1 1 4 15 -> (1 * 1) + (1 * 1) + (4 * 4) + (15 * 15) = 243 1 3 8 13 1 7 7 12 3 3 9 12 3 4 7 13 3 7 8 11 4 5 9 11 5 5 7 12 7 7 8 9