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]: [[52, -72], [-90, -59, -53, -180], [13, -64, -153], [-149, -38, 7, 61, 93, 1]]
[EX A]: [52, -53, 13, 93]

[EX Q]: [[-158, -76, -106, -126], [-200, -61], [-54, -41, 22, -34, -11], [-78, -53, 62]]
[EX A]: [-76, -61, 22, 62]

[EX Q]: [[-66, -3, 60, -48, -53, -168, -59], [-27, -197, -45, -189, 46, -1], [-91, -146], [40, 3, 46, -8], [-102, 49, 25, -198, -176], [-158, -23, -66], [-146, -74]]
[EX A]:
[60, 46, -91, 46, 49, -23, -74]