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.
[[-166, -60, 46, -169, 31], [-66, -126, -35, -128], [48, -162, -153, 34], [-100, -118], [82, -167, -68], [70, -160], [43, 64, 86, -182], [10, -109, 28], [-25, -113]]