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.
[[6, -196, 67, 25], [-48, 68, -22, 36, -95, -156, -95], [-168, -143, 33, -186], [78, -191, -25, 42, -89, 73], [-16, 19], [-8, -164, -37, -49, -155, -186], [-61, 54, -82, -100, -70, 97], [17, -79, 51]]