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.
[[-109, -93, 25, -90, 2, -104, -109], [0, -29, -192, 38], [55, -196, -85, 42, 91, -185], [-105, -117, 98, 48, 6, -15], [26, -16, -12], [-189, -55], [-158, -63, -26, -167, -32, -43], [-146, 55, 68, 53, -3]]