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.

[[-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]]
[95, 47, 66, 75, 33, 72, 9]

[[75, -65, 73, -136, -118], [51, -185], [-115, -90, 10], [53, -191, -159, -180], [-94, -98, -180, -43], [-159, 17, -78, -186], [-198, -111]]
[75, 51, 10, 53, -43, 17, -111]

[[-7, 62, -169, 29, -130], [-197, -141, 0, 18, -80], [-90, -163, -67, -138, 55], [-194, -43], [-10, -113, -138, -46, -74, -76], [-49, -153, 1, -186, -127], [-179, -191], [97, -12, -30, -178, -106], [93, 64, -151, -185, 39, 8, -57]]

[62, 18, 55, -43, -10, 1, -179, 97, 93]