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: [[-171, -189, -135, -121], [-84, 53, -190, -121, 80], [-5, -124, 98], [-99, 55, -157, 56, -18, -141, -178], [-17, -34, -82, -186], [-134, 10], [55, -124, -200, -24, -77]]

A: [-121, 80, 98, 56, -17, 10, 55]
****
Q: [[-18, -153, 98, -195], [-154, -184, -85, -25, -121, -55], [-153, -57, -109, 42], [-101, -163], [76, 11, -100, -160, 62, -181, -1], [88, 92, 83, -44, -164], [-11, -91, 82, -166, -126, -22], [53, -186, -21, 25, -191, -100], [44, 30, -195, -56, 53, -183]]

A: [98, -25, 42, -101, 76, 92, 82, 53, 53]
****
Q: [[-17, 37, 84, -197], [33, -143, -36, -84]]

A:
[84, 33]
****