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.
[[-176, -79, 30, -192, -159], [-109, 70], [-153, -51, -184], [-182, -21], [45, -108, -169, -191], [70, -177, -145, 24, -66, -131, 66]]