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.
[[91, 43, 93, -131, 45, -127, 1], [-2, -35, -1, 88, 58, 78, 94], [-189, -80, -1, -133, -41, -52, -14], [-98, -106, -195, -62, -42, -173, 12], [-54, -24], [-132, -195], [-126, -74, 66, -48], [-138, 82, 7, -167, 7, 47, -29], [-193, 40, -176, -141, 89, 83]]