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: [[-154, -145, 28, -154, -52, -41], [-198, 0]]

A: [28, 0]
****
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: [[-163, -102, -189, 15], [18, -67], [-110, -173, -100, -46, 8], [-175, 75, 20, -50, -121, 64, 22]]

A:
[15, 18, 8, 75]
****