I request you to share any Idea to solve this Question.

Given an target Integer T , Find all possible arrays of Length N such that product of elements in the array is less than or equal to T. Find ans to the modulo 10^9+7.

Constrains : N<=200 T<=10^9

->array [1,1,2] is considered different from [1,2,1].

Any suggestion or idea (rather than code) will be highly appreciated.

Thank You

Given an array A of size n and a target integer X, we need to find an array B such that ΣA[i]&B[i]=X (1<=i<=n).

If multiple answers are possible find the lexicographically smallest array B.

As constraints are unknown, I hope someone can help me to find suitable constraints too.