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.
[[-189, -200, -104, -39, -179, -15], [-129, -86, 12, 79], [-19, -154, -146, -108, -45, -6, -186], [75, 65, -27, -159, -33, 27, 2], [-142, 36, -1], [90, -138]]