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.
[[45, 63, 0], [-16, -195, 54, 63, -190, 99, -163], [-11, 21, 26, 15, 70, -38, 60], [-174, -162, -127, 1], [23, -97, -82, -108, -193, -147], [69, -33, -82, -130, -131]]