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.
[[19, -59, 98, 69, -112], [-185, -192], [-174, -105, -48, 72, 32], [6, 74], [-21, -29, -17], [61, 3], [-154, 100, 80, -76, -125, -168, -185], [-85, -86, -122, -26], [-8, -10, -72, -132]]