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: [[98, -129, 10], [-55, -168, -73, -44, -68], [-177, 91, 98, 7, -39, 85], [-26, -129, -100, 19], [-154, -80, -1], [50, -171, 3], [49, -164, 98, -108, 9, -18, -176], [-81, -17], [-30, 48, -122, -134]]

A: [98, -44, 98, 19, -1, 50, 98, -17, 48]
****
Q: [[-164, 47, -194, 68, -157, -197], [-104, -30, 57, -31], [-125, 94, -188], [3, -100, -5, -114], [88, -193, 36], [34, -122]]

A: [68, 57, 94, 3, 88, 34]
****
Q: [[-154, -12, 90, -65, -152, 32, 13], [-194, -133], [9, -85, -129, 22], [-82, -180], [84, -74, -88, -14, -115], [-166, -88, -112, -15, -176, -157]]

A:
[90, -133, 22, -82, 84, -15]
****