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.
[[-186, 89, -33], [-84, 59, 55, -19], [97, 75, -152], [100, 83, -71], [-197, -186, -151, -29, -57, 81], [-155, -85, -31, -28, -89, -142, 40]]