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.
[[-153, -81, -118, 40], [11, 10, 54, -5], [86, 24, -65, -86, 7], [-92, 18, -102, -77, 80], [-109, -123, -13, -167, -74, -196, -198], [13, -27, -141, -70]]