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.
[[-72, 100, 91, -153, -144, -157, 68], [32, 66, -168], [-179, -187, 43], [71, -105, -114, 52, 22, -167], [-124, 4, -42, 48, -123, -132, -32], [48, -132, -59, -114, -147, -36], [30, 26, -19, 62, -49], [-191, 66], [32, 100, -50, -188, 23, 91]]