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.
[[89, 45, 48, -78, -68, -153, -174], [-36, -58], [89, -22, -161, -200, -20, -184], [-45, -138, -151, -129, -105], [-83, -194, -83], [27, -155, 23, -137, -106, -98], [-1, -185, -30], [78, 45, -157, -200], [-123, -24, 31, 34]]