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]: [[-88, 39, 100, -118, -13], [-81, -150], [38, -64, -137, -74, -27, 84]]
[A]: [100, -81, 84]


[Q]: [[-91, 65, -182, -89, -129, 10, 64], [-65, 7, 2, 67, -160], [-176, -15, -177, 98, -49, -7], [-138, 46, -133, -190, -46, -187, 47], [76, 14, 42, -105, -142, -54], [-168, -16, -105, -95], [-148, 44, -18, 91, 23, -38], [56, 64, -189, -50]]
[A]: [65, 67, 98, 47, 76, -16, 91, 64]


[Q]: [[-132, -108, -117, -121, -190], [-99, -79], [-139, 74, 5, 88, 83, -6], [100, 86, -75]]
[A]:
[-108, -79, 88, 100]