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]: [[-112, -17, -98, -64, -29], [-83, -82, -31, -120, -63, -175], [-82, 56, -3, -62, -42, -110, -136], [-68, 39, -48, 64]]
[A]: [-17, -31, 56, 64]


[Q]: [[34, -57], [17, -39, -14, -158, -113, -150], [30, -23], [-97, -1, -124], [5, -76, -14, -93, 3], [-5, -41, -198, -1, 37, -102, -11], [-157, 24], [-191, -80, 81]]
[A]: [34, 17, 30, -1, 5, 37, 24, 81]


[Q]: [[-103, -151, 13, -26, 47, -120], [43, -101, -15, 12, -71, 81], [-97, -92, 58], [-105, -71, 90, -179]]
[A]:
[47, 81, 58, 90]