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]: [[-12, 54, 78, -136, -49, 2], [-26, 86, 45, -195], [-169, -89, -72], [-153, -194]]
[EX A]: [78, 86, -72, -153]

[EX Q]: [[-33, -17, 16, -125], [-15, 51, -194, -36, -4, 40], [-163, -197, -185, 99, -114, -157, 41], [35, -1, -14, -73, -149]]
[EX A]: [16, 51, 99, 35]

[EX Q]: [[-185, -5, -47, -13, 34], [-81, -165, -189, 77, -60, -128, -13], [1, -144, 82, -189], [97, -91, 76, -64, -142, 67, 70], [-162, -101, -85, -51]]
[EX A]:
[34, 77, 82, 97, -51]