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.
[[85, -79, 72], [-66, 54, -183, 74, -13, -96], [-135, -19, -28, 3, -57, -103], [-110, -104, -21], [-124, -123, -19, -191, 93, -108, -4], [36, -125, -17, -141, -112, -123], [-68, 56, 42, 74, -52, -51]]