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: [[-89, -107, -120, -129, -109, -16], [-66, -180, 68, 29, -113, -92], [-102, -113, -115, 80, -194], [-187, -134, -85, -174, -133], [-15, -124, -94, -186, -175, -54], [-95, -9, -56, -18, 94, -94, -56], [69, -24, 18, 17]]
Example Output: [-16, 68, 80, -85, -15, 94, 69]

Example Input: [[-149, -37, 36, -154, -65, 62, 57], [84, -123, 60, -42], [96, -160, -59, -77, 14]]
Example Output: [62, 84, 96]

Example Input: [[74, -117, -131, 51, -103], [56, -174, -127, -36], [42, -180, -128, 94, -130, -27, -66], [76, -16, -5, 100, -127, -36], [-185, -128, -103, 68, -46, -15, -14], [-77, -189], [40, -78, -30, -173, -124, -91], [15, -7, -21, 79, -125, 34, -58]]
Example Output:
[74, 56, 94, 100, 68, -77, 40, 79]