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.
[[-86, 7, -13, -21], [-3, -87, 9, -90, 30, -147, -62], [-35, -107], [-40, 33, -19, 96], [17, -96, -200], [-180, -119, -189, -153], [-158, -32, -30], [-130, -124, -76, 15, -63], [-196, -77]]