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.

Input: Consider Input: [[-132, -99, 9, -38, -77], [-7, 12, -183], [-158, -194], [-166, -39], [-115, -89, -104, -80, -147], [73, -200], [51, -31], [-51, -166, 69, -131], [26, -61, 53]]

Output: [9, 12, -158, -39, -80, 73, 51, 69, 53]


Input: Consider Input: [[-18, -69, 27, -166, -146, -169], [-11, -183, -102, -104, -33, 65, -19], [-27, -147], [-41, -126, -9, -125], [-28, -26], [-33, -92]]

Output: [27, 65, -27, -9, -26, -33]


Input: Consider Input: [[-22, -94, -69], [-47, 5, -184, -9, -108, -105], [-163, 50, -3, -187], [38, -136, 73, -140], [85, -2], [77, -118, -183, -79, -99, 50]]


Output: [-22, 5, 50, 73, 85, 77]