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.

[[95, 39, -13, -74, -49, -40, 31], [57, -5, 12, -24, 50, 50, 14], [-195, -144], [-90, 66], [-151, -149, -117, 54, 41, -168], [-67, 52, -41, -156, 24, 37], [-48, 20, 93, -94, -152], [-80, -95, 100, -95], [-178, 21]]
[95, 57, -144, 66, 54, 52, 93, 100, 21]

[[-23, 46, -103, -74, 16], [-161, -180, 34, -156], [80, -153], [76, -198, -198, -126, 47, -59, -193], [-99, -78, -127, 68, 68, -194, -121]]
[46, 34, 80, 76, 68]

[[-86, 7, -13, -21], [-3, -87, 9, -90, 30, -147, -62], [-35, -107], [-40, 33, -19, 96], [17, -96, -200], [-180, -119, -189, -153], [-158, -32, -30], [-130, -124, -76, 15, -63], [-196, -77]]

[7, 30, -35, 96, 17, -119, -30, 15, -77]