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.
[[-75, -134, 79, -118], [21, -185, -104, -89], [-113, -9, 38, 95, -155, -100, 65], [-46, -22, -52, 51], [-95, -53, 95, 34, 98, -66], [-159, 10, -85, -120], [-78, 100, -4, -74, -28, -29]]