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: [[75, -65, 73, -136, -118], [51, -185], [-115, -90, 10], [53, -191, -159, -180], [-94, -98, -180, -43], [-159, 17, -78, -186], [-198, -111]]

A: [75, 51, 10, 53, -43, 17, -111]
****
Q: [[-73, 37, -21, -114, -70, -143, -15], [-28, -38, 32, -102], [-192, -47, 34, -51, -69, 1, -118], [-161, -3, -23], [-176, -187, 97, -134], [97, -175], [61, -159, -108, -179, 68]]

A: [37, 32, 34, -3, 97, 97, 68]
****
Q: [[47, -46], [-108, -10, -180, -69, -160, -62], [33, -132, -15, -107, 65], [-33, -91, -9], [68, -19, 95, -182, 67, -39], [-93, 26, -161, 96, -33, -170]]

A:
[47, -10, 65, -9, 95, 96]
****