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]: [[-14, -21, 36, -53, -155, -43], [-83, 77, 97, -108, -117, 62, 5], [83, -147, -157, -169, -41], [-10, 92, -27], [-180, 1, -47], [-104, 1, -149]]
[A]: [36, 97, 83, 92, 1, 1]


[Q]: [[-68, -146], [-144, -187, -188, 43, -177], [91, -149, -134, -36, -122, 44, -100], [-2, -79, 96], [46, -113, 85, -171], [-161, -74, 80, -33]]
[A]: [-68, 43, 91, 96, 85, 80]


[Q]: [[31, -90, -107, 86, -82], [7, -137, -144], [-148, 99, -167, 4], [-150, 69, -67, -36, -33, -89]]
[A]:
[86, 7, 99, 69]