<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def in_sorted(values, value):
 """Checks if a value is in a sorted list. Uses the :mod:`bisect` builtin to find the insertion point for ``value``. Args: values (List[int]):
 Integers sorted in ascending order. value (int):
 Value to check if contained in ``values``. Returns: bool: Indicating if the value is contained. """

    index = bisect.bisect_left(values, value)
    if index >= len(values):
        return False

    return values[index] == value