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.
[[74, -25, -46, -126, -35, 25, -134], [-175, 74, -112, -135, -103, -78], [-172, 92, -60, 60, -181], [78, -6, -86, 84], [-105, 42, 32, -165, -130], [-96, -199, -179], [-33, 82, -61, -46, -140, 38]]