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: [[15, -109, -144], [-76, 24, -172]]

A: [15, 24]
****
Q: [[49, -132, -107, -113, 12], [-104, -200, -41, -52, -194, 79, -4], [-156, -107, -176, -59, -11, -126, -195], [-148, 59, -75, -123, 1, 79], [-93, 37, -105], [-44, -117]]

A:
[49, 79, -11, 79, 37, -44]
****