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]: [[-113, 36, -122, -72, -47], [-168, -23], [76, 65, -142], [-181, 20]]
[EX A]: [36, -23, 76, 20]

[EX Q]: [[-59, -69, -103, -115], [-110, 77, 55, 76, 78, 58, 40], [25, -90, -121], [-23, 81, 48, -18, 8, 94, 30], [-38, 78, 31, -125, -16, -129, 91]]
[EX A]: [-59, 78, 25, 94, 91]

[EX Q]: [[35, -126], [-21, 82, -21], [-175, -59, -200, 27], [50, 6, -137, 58, -71, -30, -91], [-103, -132]]
[EX A]:
[35, 82, 27, 58, -103]