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.
[[-82, -164, 9, 15, 16, 99, -144], [-44, 82, -135, -55], [-146, -172], [-78, 78, 50, 93, 2], [-76, 17, -192], [-31, -153, -39, -53], [38, 85, 61, -7, -15, -135], [-51, -50, -183, -189, -142]]