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.
[[11, -79, -80, 73, -190, -68, -157], [-73, -156, -57, 80], [2, -72, -28, 35, 35], [-153, -47, -101], [64, -110, -172, -44, -35, 13], [-106, -66, 19, -73]]