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]: [[-81, -174, -79], [6, -131, -75, 40]]
[A]: [-79, 40]


[Q]: [[-135, 63, -164, 33], [-23, 2], [26, -11, -148, -153, 29, -2], [-191, 18, -48, -156], [53, -144, 98, 90, 52, 44, -87]]
[A]: [63, 2, 29, 18, 98]


[Q]: [[-182, -116, -61, 41], [-22, -24, 63, -47], [-122, -46, -48, -110, -126], [-79, 54, -114, -138, -183], [-41, -197, -34, -101, 36, -76, -21], [-103, 60, 74, 75, -124, -16], [-67, -89]]
[A]:
[41, 63, -46, 54, 36, 75, -67]