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: [[-92, 82], [-90, 37], [-135, -183], [-140, 37], [-156, -132, -162, -185], [28, 67, -110, -50, -53]]

A: [82, 37, -135, 37, -132, 67]
****
Q: [[-128, -167, 12, -33, -120], [-16, -175], [-97, 34, -3, 41, -72], [50, 39, -128, -26, -96, -58]]

A: [12, -16, 41, 50]
****
Q: [[-121, -5, -69, 70], [-36, -42, -68, 75], [64, -1], [-142, -69, -161, -116, -166], [27, -30, 21, 56, 93, -116, -66], [91, -142, 89, 97, -79], [-44, -140, -9, -81, -2, -170], [0, -28, -130, 90, 3, -159]]

A:
[70, 75, 64, -69, 93, 97, -2, 90]
****