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.
[[-59, 51, -3, -131, 99, -174, 19], [-199, 5, -10], [55, -64, 36, -1], [37, -162, -110], [-195, -85], [-20, -101, 11, -79, 42, -19]]