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.
[[51, -101, -21, 92], [-198, 17, 34, -192, -78], [-34, 55, -77, -25, -153, -62, -81], [47, -197, -56, -179], [-157, -52, -143, 18, -37, -173], [76, -25, -75, 62], [-58, 62, 96, 59, 55], [-17, -90, 79, -114, 88, -114], [-198, -101, 81, -17, -7, -119]]