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: [[-166, 3, -5, -99, -138, -161], [-57, -150, -165, -173, -42, -119, 15], [-56, -79, -48, 17], [-18, 57, -129, -20, -99, -111], [-120, -191, -196, -30], [-163, -24, 56], [-196, -8, 84, 62, -45, -19, 77], [63, -18, 37]]
Example Output: [3, 15, 17, 57, -30, 56, 84, 63]

Example Input: [[14, -64, 78], [-36, -133], [-17, 49, -19, -14], [-140, -55, 35]]
Example Output: [78, -36, 49, 35]

Example Input: [[-84, 9, 91, -137, -159, -113], [-114, -105, -84], [-41, -124, 72, -120, -71, -154, -182], [86, -198, -59, -33], [-166, -115, 96, -10, -175, -20, -42], [-63, -41, 78, 16, 9, -118], [-52, -182, -63, -11, -199, -117], [-70, -154, 1, -197]]
Example Output:
[91, -84, 72, 86, 96, 78, -11, 1]