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.
[[-49, -62, -1, -26], [95, -180, -35, -102, -112, -113], [-130, -37, -2, 27, -74], [-166, -61, 27, 70, -11], [-31, -101, -54, -108, 13], [-77, -105], [-138, -30, -116, -120, -153, -116, -58], [-58, -10, -84, 7, -114, -16, -128]]