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.
[[-188, 39, -45, -24], [-142, -151, -95], [-89, 27, 78, 27, -50, -91, 0], [16, 88, -180], [-161, -146, -20, -41], [-105, -115, -165, 26], [-57, -166, -198], [25, -121], [-165, -102, -71, -59, 75]]