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]: [[-79, -105, 14, 41, -10, 26], [-96, -44, -191], [19, 34], [-56, -50, -39, -94, 79, 86], [-137, -145, -74, 26, -54, -172]]
[A]: [41, -44, 34, 86, 26]


[Q]: [[-26, 27, -21, 89, 86, -164], [96, -168], [-189, -188, -69], [-14, -14, -126, 40, -65], [52, -23, -149, 17, 90], [-171, -190, 75, 40, -187, 35], [-108, 99], [-81, 98, -137, 59], [4, -13, -66, -24, 41, -68, -147]]
[A]: [89, 96, -69, 40, 90, 75, 99, 98, 41]


[Q]: [[41, -7, 9], [11, -170, -69, -139], [-143, -175, -177, -97, -83, -105, -101], [-78, -2, -127], [29, 50, -101, -37], [83, 58, 86, -44, -50], [-159, 64, -164, -163, 40, -39, -11], [-63, 11, -164]]
[A]:
[41, 11, -83, -2, 50, 86, 64, 11]