49

The maximum possible Korean score is $49$. For each of the other $N-1$ exams, the maximum score is $100$.

Therefore, the maximum total score is

$$49+100(N-1)=100N-51.$$

For each test case, print $100N-51$. The time complexity is $O(T)$.

Solution written by GPT5.6