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.
[[-153, -16, -26, 26], [-16, -198, 93, -77, -135, -46, -26], [1, -130, -125, -166, 63, -59], [-157, -123, 100, -153, -111], [-101, -150, -84, -19, -56, -13, -13], [-130, 93, -174, -12, 4], [-162, 49, 14, 40]]