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: [[-183, 42, 41, 27, -157], [-49, -170, -103, -128], [94, -192], [42, 89], [-73, -107, -134], [5, -23, -9, 4, -151], [-96, -41, -85, -120], [-82, -74, -32, 89]]

A: [42, -49, 94, 89, -73, 5, -41, 89]
****
Q: [[-26, 27, -21, 89, 86, -164], [96, -168], [-189, -188, -69], [-14, -14, -126, 40, -65], [52, -23, -149, 17, 90], [-171, -190, 75, 40, -187, 35], [-108, 99], [-81, 98, -137, 59], [4, -13, -66, -24, 41, -68, -147]]

A: [89, 96, -69, 40, 90, 75, 99, 98, 41]
****
Q: [[31, -42, 32, -9, 22], [-161, 57, -45, -119, 88, -177], [-28, 100, 50, 98, -143, 12, -142], [-109, -99, -101], [-87, -84, -81, 57, -118, 4], [21, -94, -84], [-9, -99, 53, 94, 62, -171, -137], [-150, 70, -75, -19, 67], [55, 66, -52, 74, -113]]

A:
[32, 88, 100, -99, 57, 21, 94, 70, 74]
****