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]: [[82, -5, -106, 4], [92, -200, -78], [-93, -181, 63, 63], [15, -137, 27, -139], [-155, -26, -164, -24], [-98, -91, -127], [-127, -21, 47, 19, -190, 44]]
[A]: [82, 92, 63, 27, -24, -91, 47]


[Q]: [[-89, -107, -120, -129, -109, -16], [-66, -180, 68, 29, -113, -92], [-102, -113, -115, 80, -194], [-187, -134, -85, -174, -133], [-15, -124, -94, -186, -175, -54], [-95, -9, -56, -18, 94, -94, -56], [69, -24, 18, 17]]
[A]: [-16, 68, 80, -85, -15, 94, 69]


[Q]: [[98, -137, -79, -56, 63, -88], [-125, -44, -55, -157, -197, -88, 3], [39, -82, -137, -137], [-61, -17, -123, -40, 96, 89, -127], [-107, 86], [-133, -82], [-105, -9]]
[A]:
[98, 3, 39, 96, 86, -82, -9]