Chef and Sequence

Chef has a sequence of positive integers $A_1, A_2, \dots, A_N$. He has only one question for you: is it possible to change at most $K$ elements of this sequence to arbitrary positive integers in such a way that the condition $$A_1^2 + A_2^2 + \dots + A_N^2 \le A_1 + A_2 + \dots + A_N$$ holds? ### Input - The first line of the input contains a single integer $T$ denoting the number of test cases.