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.
[[-111, -101, -173, 17, -129, -94, 39], [37, 19, 89], [-90, 92, -175, 35, -183, -50, -36], [15, -160, -85, 55, -46, 23, -130], [-22, -165, -71, -107, 100, -171], [-121, -112, -76], [48, 12, -45, -146, 78, 74, 32], [-3, -179, -1, -86, 52, -23, 34]]