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.
[[-90, -1, 59, -61, -173, -57], [-103, -14, -112, -156], [-13, 31], [-179, -62, -55, -137], [-12, -83, -87, 44, -18, -171, -107], [-34, -175, -27, 10, -199, -124], [86, 75]]