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]: [[-42, -57, 13, -41], [45, -68, -199]]
[EX A]: [13, 45]

[EX Q]: [[-26, -102, -136], [-24, 31], [-27, -127, -134, -71], [94, -98], [-150, -182, 69, 59], [47, -49, -92], [-155, 55, -81, -194], [-8, -35]]
[EX A]: [-26, 31, -27, 94, 69, 47, 55, -8]

[EX Q]: [[-10, -72, -65, -4, -86, -132, -31], [90, -63, -184, -46, -2, 26, -178], [-157, -53, -171, -3, -114, 43], [-131, -87, 40, 32, 84, -176], [56, -149, -76, 18, -187, 11, 58]]
[EX A]:
[-4, 90, 43, 84, 58]