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]: [[-199, 11, -198, 9, -12, -184, 55], [-71, 17, -44, 64], [-144, -165, 40, 56, -179], [-151, -162, -94, -31], [-58, -4, -47, -69, -6, -168, -24], [51, -144]]
[EX A]: [55, 64, 56, -31, -4, 51]

[EX Q]: [[-117, -166, 78, 98, 72, -44, -59], [-181, 57, -154, -50, -195, -14], [-73, -73, -10, -118, -7, -121, 95], [99, 66], [68, -97, -20, 87, 67], [76, -170, 56, 32, -95, 41]]
[EX A]: [98, 57, 95, 99, 87, 76]

[EX Q]: [[-105, -133, -183, 23, 33], [27, 1, -191, 61, -160, -94, -130], [-63, -111, -158, -122, -43], [-32, 80, -36, 3, 56, -12, -128], [78, -17], [-99, -157, -63, 55, -149, -60]]
[EX A]:
[33, 61, -43, 80, 78, 55]