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.
[[-56, -137, 47, -196, 73, -90, 99], [-145, 60, -165, -186], [-11, 84, 51, -86, 95, 30, -9], [-182, 3, -105, -119], [-128, -34, -73, -45], [-44, -191, -120], [-73, -96], [-2, -63, 0, -48], [-34, -8, 12, -4, 17, -42, 13]]