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.

[Q]: [[-53, 27, -29, 53, -93], [-148, -197]]
[A]: [53, -148]


[Q]: [[-101, -168], [17, 42, -110, 20], [83, -36]]
[A]: [-101, 42, 83]


[Q]: [[9, -66, -159, -38, 26], [100, -190, -18, 17, -107], [-77, -100, -95, -8], [-129, -11, 96, -73, 94, 13, 4], [-200, -4], [70, 18, -39], [-200, -172, -99, -182, -61], [44, -197], [96, -4, -65, -10]]
[A]:
[26, 100, -8, 96, -4, 70, -61, 44, 96]