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.
[[-116, 48, -73, 75, -194], [18, -184, -144, -2, 1], [-185, -185, -9], [-122, -111], [-4, 9, -124, 91, 91, -65, -129], [-120, -79, -164, -138, 51, 80, -191], [43, -22, 79, -147, -31, -176, -44], [31, -80, -43], [95, -146, 95, -104, 87]]