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.
[[-83, 75, -166, -186, -112, 19], [24, 33, -68, -42, -11], [-57, -30], [29, 90, -199], [-183, 53, -162, 35, -144], [69, 62, 12], [68, -35, -191, -174, 73, -83, 75]]