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.

[[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]

[[15, 55, -12, -150, -97, -99], [51, -194, 44], [-80, -77, 61, 83], [13, -197, 61, -137, -41], [-116, -161, -9, -68], [-190, -182, 67, -78], [-69, -122, -119, 15, 12]]
[55, 51, 83, 61, -9, 67, 15]

[[-137, 19, -105], [-106, -169, -113], [3, -63, 94, -193, -6, 33, -79], [-7, -58], [-38, 15, -168], [-89, -130, 44, -128]]

[19, -106, 94, -7, 15, 44]