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.
[[48, 44, -5, -121], [-156, 50, -65, -48, -66, -155], [75, 20, -75], [0, 59, 31, -190], [-47, -103, 34, -32, -68, -154], [20, -23, -83, 67, -68, -174, 17], [63, -85]]