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.
[[-36, 11, 65, 43, -30, 70], [-151, -1, -93, 69, -192, -14], [36, -191, 14, 79, -80, -31, -188], [-56, -189, -107, -177]]