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.
[[-20, 74, -95, -81, -13, -48], [-176, -24], [-185, -9, -31], [-84, -136, -112, -68, -106], [-89, -181], [-74, 72, 100, 100, -109, -6, 70], [-177, -131], [75, -37, -59], [-25, 34, 17]]