Easy Mathematics

CodeChefOpen on judge ↗

Your task is very simple. Given K numbers A1, A2, ..., AK. You need to find f(N) mod max(A1, A2, ..., AK) . f(N)=N! Input - First line contains single integer T denoting the number of test cases.. - First line of each test case contains two integers N and K. - Next line contains K integers Ak Output For each test case, print a single line containing desired output Constraints - 1 T 100 -

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI