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: [[10, -72, 79], [-69, -160, -98, -33, -107, -191, -65], [2, -5, -25], [-141, -187, -113, 42, -96, -119], [4, 65, 6, -131, 81], [-142, -179], [71, -106]]
Example Output: [79, -33, 2, 42, 81, -142, 71]

Example Input: [[-50, 43, 3], [53, -199, 72, -60], [-135, 10, -186, -112], [92, -118, 88, -13, -183, -152, -20], [-173, -114, 85, -130, -153], [-186, -104], [-153, -52, -33, 41, -117, 16, -188], [-77, -47, -26, 19, -93]]
Example Output: [43, 72, 10, 92, 85, -104, 41, 19]

Example Input: [[-86, 52, -182], [-49, 20], [-25, -66, 79, -163, -78, -15], [-56, -4, 90, 31], [-180, -71], [-45, -145, 34], [-187, -128], [56, -140, -133, -194, -20]]
Example Output:
[52, 20, 79, 90, -71, 34, -128, 56]