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.
[[-60, 60, -104], [-50, -83, -64, 86], [26, -131, -100, 29, -111], [10, -15], [-48, -133, 3, 1, -154, -118, 45], [50, 77, -59, -9, -125, 55], [60, 65, -1], [-122, -75, -131, 87, -195, 66, -11], [22, -89]]