In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.

[EX Q]: [[-23, 9, 22, -37, -98], [-115, -12], [-24, -60, 60, 20, -184, -165], [-190, -3, -123, 37, -132, 59], [-104, -159, -18, -8, -10], [-128, 8, 90, -93, 63, 45, -80]]
[EX A]: [22, -12, 60, 59, -8, 90]

[EX Q]: [[15, 99], [1, -154], [-57, -131, 16, -66, -17, -102, -159], [-106, -170, -134, -142, -1, 19], [-103, -119, -123, -127, 62]]
[EX A]: [99, 1, 16, 19, 62]

[EX Q]: [[-92, -75, 60, 98, -112, -70], [-127, -35, -6, -93, -36, 46], [100, -82, -89, -72], [-97, 41, -87, 28, 84]]
[EX A]:
[98, 46, 100, 84]