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.
[[39, -76, -32, -65], [-189, -181, -38, 41, 1], [92, 75, -125, -66, -3], [-150, -137, -164, -19, -7], [81, -190, -180, -138], [-68, -67, 55], [-154, 73, -58, 91, -75, -110]]