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.
[[-136, -59, 8, -167, -55, -111, 42], [-32, -190, -112, 91, -144, -24], [-167, 26, -72, 28, -114, -114, -19], [-85, -144], [-52, 19, -78, -171], [-90, 57], [-22, -120, -198], [-81, -59, -95]]