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.
[[21, -66, -19, -170, -42, -160, 12], [-64, 36, -116], [-52, -81, -6], [-187, -23, -85, -41, 52, -117], [90, 78, -114, -142, -166], [50, -49], [-182, -194]]