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.
[[-175, -121, -165, 71, 62, -92, 49], [-30, 6, 91, -43, 19, -165], [-18, -168], [19, 89, 38, -42], [-41, -48, 94, -184, -187], [-95, -11, 54], [12, -11, -111, 31]]