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.
[[16, 8, 48, 100, 89, -190], [-26, -55, -125, -32, -18], [-153, -171], [-110, 59, 2], [7, -126, -193], [-27, -195, 4, 41], [-53, 87, -110, -131]]