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: [[62, 99, 64, 0, 34, -52, 11], [-53, 32, -147, 29, -84, -116]]

A: [99, 32]
****
Q: [[-31, -48], [7, -142, -76]]

A: [-31, 7]
****
Q: [[-147, -190, 35, -9, -110, -195], [-160, 30, -95, -184, -74, -164], [-62, 77, -87, -142, -23, 40], [-48, 60, -199, -173, 35, -103, 29], [-187, -6, -82], [-147, -165, -103, -129, -38]]

A:
[35, 30, 77, 60, -6, -38]
****