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]: [[35, -101, 13, 4, -151, 87], [50, 52, -34, -161], [-184, -19, -4, -152], [82, 30, -168, -115, -193, -139], [12, -97, -193]]
[EX A]: [87, 52, -4, 82, 12]

[EX Q]: [[-60, -47], [0, -38, -83], [-199, -140, -188, -11, -82], [-84, -86, -6, -157, -11, 6, -43], [85, 34, -189, -52], [-50, 50, -191, -105]]
[EX A]: [-47, 0, -11, 6, 85, 50]

[EX Q]: [[-46, -37, 47], [54, -121, 30, 78, -120, -158], [-21, -181, -85, -132, -124], [-60, -113, -174, -26, -113, 27], [-64, -12, 28, 60], [-197, -20, -72, -43, 2, -84, -83]]
[EX A]:
[47, 78, -21, 27, 60, 2]