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.
[[-97, 57, -197, -56, -128, -33], [-4, -136, 31, 11, -117], [-42, -41, -130, -169, -90], [-3, -115, 19, -29], [36, -134, -5, -50, -58, -148], [-175, -168, -186, -156, -112]]