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.
[[41, -92, 15, 25, 60, -28, -15], [69, -167, 14], [17, 92, -68, -163, 64], [-52, -151, 67, 38, 76, 71, 68], [-100, -198, 66], [-38, -98, -183, -20, -165, -193, -108]]