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.
[[-130, -27], [-54, 56, -69, -82, -115, -28], [96, -141, 59, -62, -9, -175], [-41, -74, 23, -136, 52, -126], [-107, -160, -159], [-158, -56], [65, -181, -177, -132, -73, -198], [-196, -67, -103]]