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]: [[-83, 24, -69, 26, 65, 98, 83], [-6, -181, 72, -139, -1, -80, 64], [48, -15, -94, -160, -61, -158, 41]]
[A]: [98, 72, 48]


[Q]: [[18, 55, -103], [-91, 6, -103, 0, -140, -53, 94], [89, -82], [-134, 30, -157, -82, -41], [-52, 77, -163], [-122, -133, -98, 48, 87, -106, 37]]
[A]: [55, 94, 89, 30, 77, 87]


[Q]: [[15, -60, 70, -71, -192, -32], [-68, -181, -140, 18, 70, -20, -13], [-164, 3, -38, 7, -198], [-136, -146]]
[A]:
[70, 70, 7, -136]