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.

[Q]: [[58, -59, 67, 49, -141, -53], [90, -175, -119, -145, -172, 72, -40]]
[A]: [67, 90]


[Q]: [[-50, -44, 70, -90], [-191, 56, -90, -125, -64], [-86, -22]]
[A]: [70, 56, -22]


[Q]: [[-183, 14, -109, -41, 32, 72], [-33, -79, -184, -27, 29], [-182, 64], [-199, -138, -114, -107], [54, 0, -95, -171, -183]]
[A]:
[72, 29, 64, -107, 54]