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.
[[24, -36, -123, -160, -105], [-160, -106, -94, -95, -125, -82], [-186, -198, -9], [31, -40, 86, -51, -148, -91, 59], [-114, -4, 93], [-99, -6, -63], [28, -139, -32, -114], [-164, -175, 7, 51, 14, -127]]