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]: [[-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]: [[-120, 64, 10, -43], [-7, -30, -37, -45, 4, -185], [-17, 44, -62, -97, -5, 10, -20], [7, 91, -56, 24], [-138, -169, -139, -172, 57, -53], [62, 31, 12, 20, -182, -188, -198], [-45, -3, -11, -187], [-10, -200, -76, -160, -151]]
[EX A]: [64, 4, 44, 91, 57, 62, -3, -10]

[EX Q]: [[57, 29, 74, 35, -5, -111], [-36, -140, 37, -112, -153], [-64, -97], [-16, 90], [-12, -26, -147], [60, -80, 80, -119, -11, -181, -136]]
[EX A]:
[74, 37, -64, 90, -12, 80]