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.
[[-26, 56, 41, 60, -60, 72], [-15, -86, 9, -168], [29, -92, 84, -180, -134, -39], [7, 38, -198, -158], [10, 65]]