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.
[[-62, 29, -7, -112, -1, 7, 80], [-99, -77, -66], [-82, -65, 36, 6], [-4, -70, 4, 58, 31, -100], [-5, -105, 4], [84, -163, -66, 15, 50, -9], [45, 97, -149, -32], [40, -89, -103, -49]]