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.
[[32, 56, -97, -33, 60, 97], [35, -146], [-80, -96, -6, 68, -182, -139, -115], [-72, 57, -50, -78], [45, -36, 59, -142, -27, -14, -165]]