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]: [[-26, -118, -136, -177, -61, -195, -191], [-118, -3, -34, -155, -125]]
[A]: [-26, -3]


[Q]: [[-4, 11], [12, -196, -120, 66, -157, -72]]
[A]: [11, 66]


[Q]: [[-123, -121, -70, -196, -136, -154], [-58, -36, 69], [-42, -94, -15, -59]]
[A]:
[-70, 69, -15]