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]: [[-178, 31, -89, -67, 55, -105], [-18, 92, -9, 69, -95, 92], [-95, 45], [-127, 57], [41, -37, 33, 41], [-72, -74, -86, -183, 86, 31], [35, -121, -199], [-165, -69, 85, -172], [14, 85, -46, -140, 25]]
[A]: [55, 92, 45, 57, 41, 86, 35, 85, 85]


[Q]: [[-60, -47], [0, -38, -83], [-199, -140, -188, -11, -82], [-84, -86, -6, -157, -11, 6, -43], [85, 34, -189, -52], [-50, 50, -191, -105]]
[A]: [-47, 0, -11, 6, 85, 50]


[Q]: [[79, -165], [-194, 6, 83, -87, -88, -184, -92], [-179, 2, -143, -1, -42, -195, 25], [-49, 75, -89, -5], [-107, 97, -50, -13, 98], [14, 76, -55, 3, 28, 8, 92], [-50, 84, 52, -149, -27, 31], [92, 82, 17], [-155, -74, 28, 9, 5, -101, -121]]
[A]:
[79, 83, 25, 75, 98, 92, 84, 92, 28]