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: [[50, -190, -70, -140, 92], [-120, -42, -110, -16, -197, 46, -152], [-180, 25, -91, -20], [19, -37, -186, -52, -171, -66]]

A: [92, 46, 25, 19]
****
Q: [[11, 10, -180, -124, -192, 98], [86, -172, -162]]

A: [98, 86]
****
Q: [[-130, -92], [-158, 91, -157, -81, 89], [-22, -43, -177, -32, -14], [-63, -36], [-42, 24, -172, -1, 6, -106], [-27, -158, -31, -125, -84], [-171, -14]]

A:
[-92, 91, -14, -36, 24, -27, -14]
****