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: [[-153, -153, -77, 39], [6, -153, -68, -193, -39], [91, -51, -48], [-140, -7], [-165, 52], [-92, 91, 70, 99, -128, -191]]

A: [39, 6, 91, -7, 52, 99]
****
Q: [[-135, 63, -164, 33], [-23, 2], [26, -11, -148, -153, 29, -2], [-191, 18, -48, -156], [53, -144, 98, 90, 52, 44, -87]]

A: [63, 2, 29, 18, 98]
****
Q: [[-54, -52], [-99, -179, -45, 47], [-194, 45, 61, 10, 5], [73, -19, 95, 24, -111, 26], [85, 67, 46, 82], [-49, -144, -163], [-150, -34], [-163, -72, -55, 36, -9, -27, 34], [30, -9]]

A:
[-52, 47, 61, 95, 85, -49, -34, 36, 30]
****