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]: [[-45, 39, 37, 4], [68, -44, 26, 94], [-98, -15, -9, -140], [-73, 23, -72], [20, 53, -23, -25, -81], [92, -5, 57], [72, 39, -80], [-75, -120, 15], [13, 38, -63, -164]]
[EX A]: [39, 94, -9, 23, 53, 92, 72, 15, 38]

[EX Q]: [[-121, -195, -57], [44, 95, -149, -20, -116, -41], [-37, -154, -161, 65, 25, -112], [-186, -114, -1, -85], [54, 11, -124, 22, 100, 54], [-140, 55, -133, -35, -3], [-54, -158, -194, -191, 31], [94, -27, 78, -132, -132, 52, -170]]
[EX A]: [-57, 95, 65, -1, 100, 55, 31, 94]

[EX Q]: [[-32, -1, 71, -157, -145], [-159, -19, -158, -128]]
[EX A]:
[71, -19]