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.
[[30, -5, 49, -64, -57, -165], [-59, -141, -119, 32, -100], [72, -38], [-140, -102], [-48, -181, -100, 12, -175]]