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.
[[-28, -162, 15, -12, -38], [-115, -5, -6, -124], [-6, -193, 90], [40, -41, -138, -30], [-168, -84, -100, -182, 96, -52], [-24, -81, -156], [32, -194, -136, -11, -108, -123], [-167, -86, 20]]