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.
[[20, 29], [-2, -139, 95, -47, 49, -93, -14], [-157, -199, 67], [91, -157, -110, -195, 4, -158], [-19, -168, -11, -191, -120], [49, 13], [-125, -154]]