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.
[[24, -90, 32, -47, -37], [-58, -4, -106, 28], [-138, -66, 64, 64, 76, -175, -16], [41, -6, 46, -91], [99, -76, -123, -24, 89, -129], [64, 61], [-119, 96, -116, -88, 2, -109, -70], [85, -53, -162, -198, 83]]