*** hi to ALL

I have very stupid doubt related to time complexity…

my doubt is here…

1<=T<=P (TNo. of test Cases)

1<=N<=K (NInput size…)
*suppose time complexity of solution for a given test instance… : O(M)
then what should be complexity for my solution…

O(PxM) or O§

here is demo…

1<=t<=100, denoting the number of test cases,followed by t lines, each containing a single integer n, 1<=n<=100.

total complexity of my solution for a test case O(n)

what is total complexity O(txn) or O(n)??***
in other word…shall be take care of number of test cases while computing time complexity of our solution??