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.
[[-92, 80, 48, 34, -176, -99, 15], [38, -181, 6, -160, -161], [-169, -185, -197, -188, -23], [30, -173, -145], [49, -97, -33, -118], [-89, 4, 63], [49, 65], [-72, -135, -167, -117, 71, -17, -150]]