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.
[[29, -197, -93, -91], [-10, 69], [-57, -11], [-68, -129, 58, -40, -77, -66, -164], [6, 17, -1], [53, -21, 50], [-2, -166, 32, -59, 60]]