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.
[[76, 76, -17], [-37, -131, -136], [-46, 6, -15, 63], [-200, -133, -101, -164, -25, 55, -10], [-54, -112, -7, -97, -1, 90, -69]]