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, 93, 25, 81, -147], [10, 45, -122, -142, 10, -73], [66, -50, -72, 41, -54, -9], [-99, -165, 87, -5, -191, -39], [80, -131, -100, -59, -134, -60], [-25, -107, 0, -36, -86, -53], [47, -172, 13, -9], [-124, -143, -170, 73, 74, -66, -182]]