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: [[-119, -83, 95], [-198, 47, 25, -195, -159, -118], [66, -138, -98, -3, 65, -142], [8, 43, -166, 75], [-181, 33, -194, -82], [-31, -9, 38, -75, 72], [9, -187, -179]]

A: [95, 47, 66, 75, 33, 72, 9]
****
Q: [[-143, 33, -146], [-82, -145, -105, -21], [0, -95, -164], [-153, 9, 51, 84, 71, -82], [5, 73, 67, -153, 11, -136], [-1, 81, -75, -41], [-102, -43, 69, -150]]

A: [33, -21, 0, 84, 73, 81, 69]
****
Q: [[-64, -117, -84, -27, -15, -182, 65], [86, 11, -46, -25, -124, -38, -151], [-175, -103, 36, -165], [-156, 5, -92, -77, -197], [-109, 88, -134], [-30, -158, -80, 39], [-56, -7], [-10, -77]]

A:
[65, 86, 36, 5, 88, 39, -7, -10]
****