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]: [[-153, -194, 66, -24], [-9, -170, -188, -20, 16], [-160, -44, -44, 16, 2, -146], [10, -66, -148, 69, -48], [12, -55, -153, -2, -11], [-149, 38, 27, -107, 80, -183]]
[EX A]: [66, 16, 16, 69, 12, 80]

[EX Q]: [[-27, -95, -24, 21, -4], [-82, 46, 70, -26, -123, 20], [49, -103, 64], [-107, -168, 6, 38, -46], [-180, -187, 64], [-105, -27]]
[EX A]: [21, 70, 64, 38, 64, -27]

[EX Q]: [[-160, -89, 70, -29, 97, -158], [-71, 24, 32, -99, 12, -44], [-171, -191, 64, 8, 33, -196, -15], [-77, -133, 81, -12], [59, -75], [-152, -192, -93, 13, 61], [-75, 55, -137, 5, -151], [-56, -183, -118, -116], [87, 77]]
[EX A]:
[97, 32, 64, 81, 59, 61, 55, -56, 87]