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.
[[-82, -78, 10, -160, -59, 19, 73], [-4, 21, -43, -6, -36, 97, 18], [22, 47, -2], [16, 23, -172, -114, -193], [27, -146, -5, 77, 95, -35], [97, -186, -193, 50, -150, 24, -115], [97, 44, -106, -99, -101], [-66, 66, -39, 95, -38, 2, 66], [-49, -37, -163, -195, 52, -52]]