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.
[[3, 92, -1, 15, 31, -60, 48], [31, -52, -183], [-150, -82, -82], [-57, -58], [-199, -54], [53, -161, -136, -1, -149, -150], [-89, -145], [54, -137, 46, 20], [-51, 38, 95, 58]]