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: [[-2, -59, -139, -19, -120], [-148, 59, 73, -148, 27], [94, -73, -135, 45, -75, 23], [81, -132, 2, -132, 49]]

A: [-2, 73, 94, 81]
****
Q: [[-198, -161], [66, 7, 92, 36, -103, -44], [-121, 33, 33, -183, 81, -87, 6], [-125, 1, -186]]

A: [-161, 92, 81, 1]
****
Q: [[-72, -138], [95, -51, 21], [64, -75, -168, -124, -178, 10], [16, -75, -107, -111], [-73, -43, -140], [-22, -157, 16, 49], [-159, 70], [9, 40, -50, -105, -94, 59, -195], [-11, -175]]

A:
[-72, 95, 64, 16, -43, 49, 70, 59, -11]
****