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.
[[13, -90, -80, 42, -105, 11], [-98, -19, -152, -77], [-142, -35, -146, 63], [-16, -52, -26], [-8, 54], [-106, 60, -86, -53, 1, -47], [-33, -185, -191, 91, -48, 33, 11], [-191, -49, -102, 13, -120], [-64, -144, -85, 83, -115, 79, -161]]