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.
[[-197, 65, -141, -166, -138], [-73, 61, -12, 9, 85, -7], [-100, 54, -138, -81], [-64, 25, 31, -158, 31, -73], [-8, 79, -61, -170, -22, -31, -135], [-200, 60, -161, -66], [98, 81, 55, -55, -198, -150]]