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.
[[-177, -51, -83, 37, -159, -15, 53], [1, -50, -197, -23], [62, -190, -25, -101, -101], [-22, -171, 100, -107], [82, -174], [41, -11, 3, 76, 10, -166], [-19, -171, -169], [-67, -164, -76, -181], [-132, -59, -62]]