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: [[-3, -50, 28, 67, -12, 97, -98], [41, 88, 81], [44, -50, -49, -132, -161, 26]]

A: [97, 88, 44]
****
Q: [[-19, -186, -36], [-137, 15], [-194, -73, -48, -110, 24], [-3, -6, -4, 28, 84], [-195, -138], [76, -1]]

A: [-19, 15, 24, 84, -138, 76]
****
Q: [[-80, -61, 47, 99, -114, -80, -183], [-59, -57, -196, 74, 22], [44, -188, 86, -9, 1, 30]]

A:
[99, 74, 86]
****