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.
[[50, -57, -124, -137, -135], [-149, -114, 11, -159], [-108, -102, 62, 24, 65, 7, -111], [100, -167, -74], [31, -102, -108], [92, -171, -103, 41], [56, -43, 21], [56, -29, -6, -26, 96], [13, -92, -25, -162]]