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.
[[95, -57, -58, -49], [45, 51, -141, -186, -129, -136, 26], [-104, -99, 16, 90], [-167, -1, -6, 63, -91, -111], [48, -13, 5, 5, -88, 88, -105], [-45, 62, -55, 89, 14, -3], [98, -79, -104, 41, -179], [43, 44, -1, -68]]