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.
[[21, -29, 97, -110, -171, -181], [65, -105], [-78, 66, -143], [-21, -89, 54, -79, 83], [-130, -50], [-64, 18, -15, -113, -7, 37, -29], [-62, -127, -112, -158], [-123, -15, -65, -171]]