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.
[[68, -42, 21], [28, 6], [-148, -45], [-191, -195, -76, -13], [44, -148, -31, -71, -134], [-125, 93, 46, 71, 15], [98, -19, 44, -76, -118]]