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.
[[31, 28, -181], [72, 72, 3, -123, -52], [-19, -156], [-161, -81, 53, 58, 6, -189], [-9, -171, 99, 45], [-3, -42], [-106, -49, -177, -21, -37, -26], [97, 3, -130, -30, 15]]