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]: [[-50, -44, 70, -90], [-191, 56, -90, -125, -64], [-86, -22]]
[A]: [70, 56, -22]


[Q]: [[15, 99], [1, -154], [-57, -131, 16, -66, -17, -102, -159], [-106, -170, -134, -142, -1, 19], [-103, -119, -123, -127, 62]]
[A]: [99, 1, 16, 19, 62]


[Q]: [[37, 61, 68], [-37, -6, 33, 58], [8, 19, -108, -97, 83, 37], [-20, -87], [62, -21, -28, -117, -46], [-56, 5, -168, -182, 26, 76]]
[A]:
[68, 58, 83, -20, 62, 76]