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.
[[-67, -25, -29, -13, -70, 48], [-26, 51], [-7, -156, 91, -41, -183, -123], [-129, 26, -20], [-193, 47, 28, 65], [9, -121, -32, -109, -9, -191]]