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.
[[-79, -59, -89, -135, -128, -164, 31], [-164, 7], [-173, -116, -10, -196, -123, -130], [-10, -111, -128], [-31, -139, -26, 94, -9, -151], [-82, 95, -188, 91, 21]]