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]: [[100, -56, -195, -111], [-102, -4, -87, -166, -68, 84, -157], [-63, -119, -190], [-144, -55], [-103, 19, 5, 78, -135, -153], [58, 15, -108, -178], [36, 73, -175, -74, -179, 86], [29, 41, 99, -75, -22, -174]]
[EX A]: [100, 84, -63, -55, 78, 58, 86, 99]

[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]: [[5, 38, -59, -20, -26, 53], [-1, -16, 92, -62, 30], [90, 83, 25, -3], [97, -9, -2, -84, -35, -3], [29, -180], [17, 66], [40, -10, -57, -56], [72, 86, -52, -71, -173]]
[EX A]:
[53, 92, 90, 97, 29, 66, 40, 86]