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]: [[-184, -9, -39, 19, -2], [-122, -141, -96, -147], [-100, -186, 60, 52], [43, 38, -18, -20, -150, -40, 50], [63, -70, -158], [58, 38, 42, -13, -61, 30, -129], [1, 92, -75, 2, -7, -88], [-63, -192, -194, 44, 67, 20, -100]]
[A]: [19, -96, 60, 50, 63, 58, 92, 67]


[Q]: [[-23, 34], [-9, -35, 39, -132, -43], [-195, 62, -128, -159, 62, -122, -109], [-98, 66, 28], [-48, 38], [-85, -91, -181, -129], [-125, -140, -162, -66, -2], [-196, -53, -117]]
[A]: [34, 39, 62, 66, 38, -85, -2, -53]


[Q]: [[2, -138, -171, -156, -18], [80, -175, -132, -144, -187, 15, -35], [48, 0, -129, 6, -43, 15, -81], [-182, -119, -33, -118], [-193, -147, 56, 92, -153, -107], [-12, 15], [-190, -137], [-184, -198, -92]]
[A]:
[2, 80, 48, -33, 92, 15, -137, -92]