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.
[[-41, -63, 51], [-191, -71, 13, -131, -157, -136, -62], [85, -160, 38], [-108, 16, 19, -20], [-118, -39, -186, -119, -114, -14], [-3, -162, -85, -24, 93, 60]]