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.
[[68, -131, -177, -46], [-158, -23, 11, -92, -143, -55], [82, 71, -77], [-13, -42], [-179, 15, -172, 20, -29, 36, -66], [-68, 25, -17]]