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: [[-46, 14, -141, -77, -62], [-183, -86, -115], [-146, -60, 34], [-42, 19, -101, -49, 47], [-117, -174]]

A: [14, -86, 34, 47, -117]
****
Q: [[-163, -129, -176, 12], [-28, -195, -125, -107, 23, 69], [-128, -129, -47, -30], [-53, -56, -32, -67, -7, -81, -156]]

A: [12, 69, -30, -7]
****
Q: [[41, -138, -116], [-138, -31, -31, -44, 81, 84, -29], [-73, -154, -158, 6, -3, 53, 0], [-168, -114, 3, -163, 31], [72, 78, -163, -159, -199, -31, 0]]

A:
[41, 84, 53, 31, 78]
****