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.
[[-198, -106, -69, 16, 85, 82], [-35, -15, 61, -69], [-51, 30, 69, -38], [-113, 71, -52], [-58, -79, -137, -93, -142, -89], [-191, 78, -96, -159, -46, 73, 38], [11, -13, -151, -175, -100, 74, 41], [-55, -178, -114, 30, 91, -195, 85]]