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.
[[85, 31, 37, -3, 11, -116], [-112, -100, -114, -15, 13], [-148, -40, 11, -31, 94, -95, -141], [-62, 4, 63, -145, 77, -102], [-94, 40, -145], [50, -39, -122, -116, 69, -14], [4, -150, -72, -57, -200, -170, -150], [81, -155, -200, -98, -69, 77, -20]]