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.
[[100, 30, 33, -166, -28], [52, -194, 55, 92, -82, -166], [84, -94, 53, -189, 28], [-166, -41], [-131, 74], [-60, 80, 45, -84, 4, 68], [-164, -149], [69, -149, -52, 7, -99, 47]]