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.
[[80, 99, 56, -154, 13, 74, -188], [-119, -80, -6, 62, -158], [-163, 27, -162, -89, -194], [-111, -39, -165, -137, 65], [-185, -92, 71, 52], [64, -31, -187, -51, -103, -69, 46]]