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.
[[-16, 26, -117, -89, -64], [-174, -86, -152, -90], [-53, 48, 94], [-135, -38], [-164, 62, 28], [-167, 35], [-90, -88, -15, -135, -74, -73], [48, 41, 96], [-161, -22, -95, 76, -18, 9, -197]]