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: [[-18, -69, 27, -166, -146, -169], [-11, -183, -102, -104, -33, 65, -19], [-27, -147], [-41, -126, -9, -125], [-28, -26], [-33, -92]]
Example Output: [27, 65, -27, -9, -26, -33]

Example Input: [[-60, -47], [0, -38, -83], [-199, -140, -188, -11, -82], [-84, -86, -6, -157, -11, 6, -43], [85, 34, -189, -52], [-50, 50, -191, -105]]
Example Output: [-47, 0, -11, 6, 85, 50]

Example Input: [[-32, -184, -7], [67, -180, 100, -131, -20], [-103, 54, -141, -71, 36, 100], [-70, -1, 93, -166, -58, 19], [-42, -121, 22, -106, -117], [-96, -122, -76, 48], [-53, -145, -37, -120, 50, 70, 90], [6, 23, -63, -41, -170]]
Example Output:
[-7, 100, 100, 93, 22, 48, 90, 23]