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.
[[49, -38, -95], [-4, 24], [60, -32, -195, -168, -98, -191], [-17, -90, -181, -83, -162], [66, -171, -159], [-131, -160, 74, -77], [6, 78, -108, -181], [17, -68, -37], [-104, -121, -29, 45, -150, -127, -14]]