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, -174, -145, 0, -28, 3, 33], [-129, 72, 92, 49, 40, -121, 40], [13, -45, -26, -112], [-41, -175, -131, -114], [-59, -61, -107, 56, -80], [-32, -119, -159, -194, -165, -64], [-16, -25]]