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.
[[26, -42, -70], [65, 99, -178, -81, -23, 66], [-101, -62, -180, -123], [15, -85, 93, -164], [96, -37, -109, -169, -84], [-45, -168, 12, 5, 77, 100, -37], [-152, -196, -90, -129], [-91, 21, 33, 70]]