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: [[-6, 41, -190], [-47, 89], [29, -17, -135]]

A: [41, 89, 29]
****
Q: [[-123, -135, -68], [-5, 30, -61, -105, -111], [70, 99, -198, 44, -10, 73], [-3, -54, 15, -79, -84, -4, -94]]

A: [-68, 30, 99, 15]
****
Q: [[-11, -162, -182], [-65, -109, 12, -19], [-15, 39, -16, 42], [-60, -177, -141], [20, -133, -158, -18], [-145, 3, -42], [70, -192]]

A:
[-11, 12, 42, -60, 20, 3, 70]
****