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.
[[41, -7, 9], [11, -170, -69, -139], [-143, -175, -177, -97, -83, -105, -101], [-78, -2, -127], [29, 50, -101, -37], [83, 58, 86, -44, -50], [-159, 64, -164, -163, 40, -39, -11], [-63, 11, -164]]