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.
[[-106, -37], [-179, -83, -41], [100, -55, -26, -184, 37, 77], [-116, 5], [61, -23, -66], [18, -136, -17], [-50, -90, -91, -70, 11], [-102, -166, -173, -143], [80, 26, -24, -26, -142, -76]]