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.
[[-132, 53, -122, -197], [-68, -167, -171, -145, -191, -168, -75], [-103, -139, -39, -54, -13], [-168, -138, 46, 20], [-147, 2], [34, -28, -59, 7, -143, -152], [3, 61, 25], [69, 0]]