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]: [[-27, 12], [-33, -163, -183, -45, -110, -33, -10], [-186, -48], [-35, -145, -161]]
[EX A]: [12, -10, -48, -35]

[EX Q]: [[-12, 54, 78, -136, -49, 2], [-26, 86, 45, -195], [-169, -89, -72], [-153, -194]]
[EX A]: [78, 86, -72, -153]

[EX Q]: [[32, -67, 59, 53, 80, -102], [-86, -59, 31], [7, -87, 63, -51, 100, 59], [1, 66, 76, 66, -21], [-71, 25, -1, 0]]
[EX A]:
[80, 31, 100, 76, 25]