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.
[[-46, 30, -30, 34, -19], [-89, 0, 81], [97, -51], [-6, -110, -160, 9, -141], [-132, 92, 3, -193, -21, -142, 20], [55, -180], [86, -1, 60, 53], [-31, 31, -70, -65]]