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.
[[10, -106, -199, -115, 81], [-6, -12, 81, 11, 22, -154], [-49, -129, -72, -128, -149], [-186, 66, -198, 23, -162, -96, -109]]