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: [[-116, 8, -187, -74, -77], [-94, -11], [-145, -120, -47], [-178, -61, -91, -105, 24, 20], [61, -196, -157, -35, 35, -43, -195], [-193, -67], [-44, -22, -119, -11, -193], [70, -153, -120, 14, -140], [10, -170, -131, 6, -151]]
Example Output: [8, -11, -47, 24, 61, -67, -11, 70, 10]

Example Input: [[-200, -55, -94, 83, -144, -15], [83, -73, -2]]
Example Output: [83, 83]

Example Input: [[-147, -35, 60], [63, 15, 90], [1, -36, -5, -173, -166], [-187, -182, -12], [-45, -81]]
Example Output:
[60, 90, 1, -12, -45]