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.
[[-198, 43], [28, 89, 59, 30], [-51, -136], [-37, -28, -169, -147, -123, 8, -25], [74, 19, -75, -164, -86, 61, -74], [72, -182, 2, -145, -60, 79, 86]]