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.
[[5, -118, -34, 96, -26, -142], [-160, -95, -32, 73, 35, -72], [-101, 80, -65, -123], [-120, 56, -66], [-124, 80], [15, -136, 26, -133, 10, 54, -26], [-60, -36, 10, -39, -76, 40, -116], [12, -69, -195, 51, 31], [-115, -79]]