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.
[[-126, -25, -114, -88, -11, -31, -116], [-25, 71], [51, -200, 83, 54, -36], [28, 43, -38], [-1, -61, -85, 2, 43], [-197, -46, -187, 43, 75]]