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.
[[16, -69, 48, -153, -167, -29], [66, -165, -115, -160, 93, 69], [-42, -68, 36, 33], [-191, -20, -7, -21, -199, -181]]