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.
[[-194, -35, 91, 43, 99, 99, -64], [-121, 57, -27, -138, -97], [-172, 10, -5, -130, 19, -186], [-88, -11, -93, 50, -46, -69, -165], [2, -90, -157, 59, -28, -190], [-121, 46, -164, -96, -42], [-22, -28, -142, -59, -37, -187], [-50, 100, -61, -25, -47, -196, -164], [45, -138]]