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: [[-79, 48, -148], [-119, -87], [-60, 96, -89, -162], [-171, 8, 54], [16, -66, 91, -22, 4, 39, -60], [58, -143, -29], [-24, -23]]

A: [48, -87, 96, 54, 91, 58, -23]
****
Q: [[41, -199, -65, -168, -36, 58, -56], [-77, -129, 54, -46, 54, -38, -171], [-163, 100, -20, -74, -64], [50, 65, -124, -61, -167, 53, 38]]

A: [58, 54, 100, 65]
****
Q: [[-73, -115, 43, -145], [-90, -82, 27, 56], [-22, -108, 8, 98, -152]]

A:
[43, 56, 98]
****