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.
[[-19, 8, 38, -13, -110, -189, -108], [33, -30, 75, 58], [-123, -150, -79, -168], [-123, -179, -161, 5, -140, 73, -127], [24, -164, -118, -66, -59, 51], [-146, -122, -37, -80, -180, -37], [-35, 97, -47, -154, -178, 6]]