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.
[[38, -109, -175, -102, -22, 70, 47], [-28, 25, -135, -191, -71, -15, 83], [59, 34, 31, 19, -107, -111], [-63, -57, 75, -190, -75], [-185, -105, -196], [64, -163, -173, -31, -2, -174, -186], [39, 93, -17, 22, -113, 34, -55]]