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.
[[25, 71, 41, 73, -168], [81, -135, -129], [-96, 15, -167, 16, 18], [11, -4, 67, -197], [-117, -99, -74, 25, 68], [-186, 100, 8]]