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.

Example Input: [[-200, -120, -174, -82, -148, -12], [-40, 8], [76, 24, 48, -1, -89, -107], [96, -88, -195, 58, -136, 17], [-176, -36, -147, -183, -86, -70]]
Example Output: [-12, 8, 76, 96, -36]

Example Input: [[-96, 57, -186, 28, -171], [80, 54], [-20, -187], [-50, -169], [-13, 8, -129, -76, -46], [-119, 64, -170]]
Example Output: [57, 80, -20, -50, 8, 64]

Example Input: [[-32, 43, -199, 37, -162, -187], [-63, 42, -64], [-161, 15, 45, 65, -98], [-42, 64, -194, -125, 55, -159, 64], [-62, -141], [-76, -103, -88], [-17, -135, 41, 3, -198, -181, 42], [70, 46, -164, 13, -43], [-98, -51]]
Example Output:
[43, 42, 65, 64, -62, -76, 42, 70, -51]