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.
[[33, -8, -177, -18, -131, 54, -80], [-176, 50, 4, -169, -21, 100, -6], [74, 54, -191, -172, -127, 41], [58, -34, 65, -58, -66, -16, 90], [-151, -199, -36, -102, 39], [34, -42, 61, -36], [-162, 73, -107], [-150, -4, 38], [-47, 82, -71, 91, 56, -20, -13]]