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]: [[100, -56, -195, -111], [-102, -4, -87, -166, -68, 84, -157], [-63, -119, -190], [-144, -55], [-103, 19, 5, 78, -135, -153], [58, 15, -108, -178], [36, 73, -175, -74, -179, 86], [29, 41, 99, -75, -22, -174]]
[A]: [100, 84, -63, -55, 78, 58, 86, 99]


[Q]: [[-27, -95, -24, 21, -4], [-82, 46, 70, -26, -123, 20], [49, -103, 64], [-107, -168, 6, 38, -46], [-180, -187, 64], [-105, -27]]
[A]: [21, 70, 64, 38, 64, -27]


[Q]: [[-121, 98, 21], [-98, -174], [94, 95, -194, -63], [64, -35, 2, -52, 79, 35, 54]]
[A]:
[98, -98, 95, 79]