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: [[-60, -149, -20], [31, -93, -100, -187, -19, 18, 93], [-171, 17], [-97, -86, -188, -76, 91], [5, 69, -169], [-148, 44], [-180, -21, -51, -198], [-193, -197, -103, 98, 80, -148], [-158, -43, 25, -150, -153]]

A: [-20, 93, 17, 91, 69, 44, -21, 98, 25]
****
Q: [[-138, 20, 9, -133, -166, -153], [-71, -103], [-144, 9, -15, 2, -17, -172, -139], [97, -35, 16], [-77, -46, 46, -41, -12], [-166, -84, -193, 17, 12, -142], [-76, 90, -186]]

A: [20, -71, 9, 97, 46, 17, 90]
****
Q: [[43, 30], [-5, -86, -180, -8, 72], [-198, -109, -189, 4, -87, 91], [-196, 50, -7, -1], [-45, -145, -19, -105, -192, -120], [70, -113, 55, -140, -128], [-155, -99, -100], [-6, 42, 86]]

A:
[43, 72, 91, 50, -19, 70, -99, 86]
****