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.
[[25, 17, -3, 16, 18], [-54, 34], [-146, -19, -157, -94, -67, -177, 96], [-120, -51, -184, -200, -151, 97], [-110, -21, -3, 1, 76, -177], [-168, 75, 92, -20, 30]]