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.
[[32, -65], [-176, -176], [-145, 17, -14, 39, 11, 47, 49], [-32, -180, -20], [-139, 11, 89, -112, -26, -177]]