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: [[-51, -92, -181, -134, 56, -85], [-87, -90, -147], [97, -178, -18, -191, -55, -164], [5, -145], [37, 67, 75, -112, -191, 34], [100, 17], [-165, 4, 39, -184, -136], [-94, 22, -33, 24, -13, 38]]

A: [56, -87, 97, 5, 75, 100, 39, 38]
****
Q: [[-86, -87, 49, -98, -10, -60, -42], [-88, -27, -163], [-174, -132, -148], [-103, 1, -198, 6, 98], [-172, -152, 63, 9, -166, -70, 73], [-91, 30, 74]]

A: [49, -27, -132, 98, 73, 74]
****
Q: [[26, -80], [59, -80, -41, -41]]

A:
[26, 59]
****