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, 86, -15, -87, -161], [-20, -115, -91, 23, -43], [-105, -37, -100, 78], [68, -148, -2, 20, -122], [-116, -163], [72, -155], [47, -94, -93, 55, -4, -177], [53, -120, 50, -12, -97]]
[EX A]: [86, 23, 78, 68, -116, 72, 55, 53]

[EX Q]: [[-198, -26], [-126, -188], [-169, 5, -181, 23, -158], [-175, 64, -109, -107, 95, 44, -7], [-118, -66, 100, 24], [13, -90]]
[EX A]: [-26, -126, 23, 95, 100, 13]

[EX Q]: [[-88, -29, 49, 50, -181, -65], [-78, -19, 47, 48]]
[EX A]:
[50, 48]