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.
[[-139, -32, 70, -186, 5, -63, 13], [-134, 27, -18, -63, -138, -190], [-112, 47, -39, 42, 43, -110, -19], [69, -73, 48, -32], [93, -126], [12, -143, -114, -159, -190, -45, -171]]