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.
[[18, 60], [71, -5, -152, -90, 52], [30, -121, 47, 12, 34, -110], [-19, -154], [-112, 36, -85], [-106, -168, -3, 43, -95, -163, -161], [-166, -68, -17, -90, -197, -191]]