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.
[[15, -198], [-185, 44], [-88, 68, 67, -32], [13, -27, -109, -198, -99, -80], [-32, -156, -193, -105, 29], [-196, 1, -26, 80, -94], [97, -101], [34, -81, -145, -29]]