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.
[[-158, -130, -65, -100, 75, -14, -165], [-33, -55, -20, -120, 33], [98, -159, -186, -135, -68, -135], [-118, 23]]