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.
[[-116, 79, -161], [56, -25, 77], [-17, 65, 13, 58, 44, -97], [-14, 7, 47, -116, -121, 54, -45], [8, -124, 80, 95, -9, -151], [88, -108, -26, 21], [83, -98, -48, -131, -17, -34, -166], [27, -83, 22]]