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]: [[41, -199, -65, -168, -36, 58, -56], [-77, -129, 54, -46, 54, -38, -171], [-163, 100, -20, -74, -64], [50, 65, -124, -61, -167, 53, 38]]
[A]: [58, 54, 100, 65]


[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]: [[68, -91, 88, 24, -70, -26], [50, -9, -133, -121, -5, -25], [-132, 30], [-101, -11, -164, -146, 23, -3, -82], [-11, -23, -3, 70, -57, 71], [28, 37, -154, 33, 45, -52]]
[A]:
[88, 50, 30, 23, 71, 45]