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.
[[-95, -76, -103, -96], [-61, 9], [-189, 61], [-167, -188, -68, -12, 69, 26], [-2, 77], [-168, -101, -151, 91, 91, 60], [-28, -85, -143, -96, -171], [-35, 29, -19, 68, -102, 6], [-31, -36, 36, 9, 8, 93, -57]]