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.
[[-167, -28, -168, 2, -195, 79, 61], [-162, -169, 37, -34, -6, -72, 35], [87, 23, -186, -155, -38, 77], [-67, 61, -46, 2, -38, 65], [16, -62, -169, 89, -137, -136], [-90, -111]]