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: [[-61, 31, -135, 15, -167, 30], [-1, -18], [65, 41, -43, -165, -28, -135], [-15, -117], [-38, -151], [12, 59, -5, -79, -104, -109, -93], [-66, -61, -171, -23]]

A: [31, -1, 65, -15, -38, 59, -23]
****
Q: [[56, -4, -191, -182], [47, -70, -154], [-16, -195, -67, -196, -12]]

A: [56, 47, -12]
****
Q: [[-180, -114], [40, -93, 68]]

A:
[-114, 68]
****