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.
[[81, -112, 83, -92, -76, -169], [-181, -93, -42, 34], [-52, -191, -116], [-70, -141, -148, -192, -101, -104, -78], [-55, -196, -194, -82], [-8, -71, 37, -134, 44, -190, -102]]