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]

[[84, -86, 87, -13, 3, -132, 58], [41, -141, -89], [45, 53, 6, -87]]
[87, 41, 53]

[[-59, 47, 48], [20, 80, 29, -45], [-176, 74, -98, -30], [-78, -178, -107, -13, 28, -80, -200], [46, -71, -66, -2, -136, 97, -76], [-80, -53, -51, -8]]

[48, 80, 74, 28, 97, -8]