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, -53, -62], [16, -152, -114, 16, 53, -199], [-191, 10], [15, 59, -34, 70, -107, 13], [-97, 99, 43], [-68, -81], [47, -62, -78, -82, 19, 58, 40], [-119, 53, -182]]