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]: [[-200, -55, -94, 83, -144, -15], [83, -73, -2]]
[A]: [83, 83]


[Q]: [[-132, -76, 25, -68, -72, -190], [-58, 59, -16, -123, -19], [-59, -77, -62], [67, -196, 54, 90, 10, 14, -154], [44, -145, 36, 68, 11, -139, -120], [-90, -84]]
[A]: [25, 59, -59, 90, 68, -84]


[Q]: [[23, 73, -22, -113, -27, 83], [-132, -101, -52, 96, -83], [-160, -38], [-155, -46], [-57, -180, -185, -71, -60, -194, 24], [-10, -45, 39, -36, -73, -86], [-125, -14, -143, -73]]
[A]:
[83, 96, -38, -46, 24, 39, -14]