def common_in_nested_lists(nestedlist):
    if not nestedlist:
        return []
    result = set(nestedlist[0])
    for lst in nestedlist[1:]:
        result = result.intersection(set(lst))
    return sorted(list(result))