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]: [[21, -143, 100, -121, 53], [-196, 60, 71], [-71, 38, -90, -65, -98], [-76, -31, -114, 10, -102, -81, 11], [-132, -94, -171, -142, -1, -80, -90], [8, -113, 13], [-114, 79], [-142, -194, -116, -90, 30]]
[EX A]: [100, 71, 38, 11, -1, 13, 79, 30]

[EX Q]: [[-81, -174, -79], [6, -131, -75, 40]]
[EX A]: [-79, 40]

[EX Q]: [[41, -78, 50], [-197, 45, -88, -31, -165], [47, -173, -134, -125, -72, 86, -85], [-143, -70], [65, 7]]
[EX A]:
[50, 45, 86, -70, 65]