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.
[[-89, -151, 36, 34, -139, 35], [68, 32, -6, -183, 61, -195], [-7, -150, -55, 35, -78, -1, -113], [-70, -19, -6], [-127, 87, 52, -43], [-123, -70, -47, -98], [-138, 89, -110, 65, -20], [-160, -80, -110, 2, -12, -39, 17]]