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.
[[-123, -139, 73], [-85, -161, -188, -30], [68, -22, 45, -41], [15, 81, -24, -130, -147, 10, -20], [-174, 100, 66, 49], [-82, -69, -31, -163, -45, -125], [-130, -100, -21, -180, 98, -24, -31]]