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: [[60, -29, -4, -29, 18, -10], [-36, -96], [67, -88, 94, -86, 8, -72], [68, -27, -83, -29, -109, 20], [19, 36], [-121, -64], [-165, 30, 41, -119, -11, 38]]

A: [60, -36, 94, 68, 36, -64, 41]
****
Q: [[-37, -136, 90, -104], [-33, -60, -12], [-7, -27, 100, -101, -172], [6, -150, -75]]

A: [90, -12, 100, 6]
****
Q: [[-20, 6, -31, -170, -162], [32, -56], [-82, -151, -2, -123, -122], [55, -61, -98, 77], [-108, 89, -120], [14, -124, 6, -46, 55], [88, -167, -73, 17, -172], [2, -23, 72], [-197, -8]]

A:
[6, 32, -2, 77, 89, 55, 88, 72, -8]
****