```python
def all_Bits_Set_In_The_Given_Range(n, l, r):
    """
    Checks if all bits in the number `n` from position `l` to `r` are set (1).
    Positions are 1-based, from right to left.
    Note: The task description contradicts the function name. This implementation
    follows the function name, checking if all bits in the range are SET.
    """
    # For an invalid or empty range, the condition is vacuously true.
    if l > r:
        return True

    # Calculate the number of bits in the specified range.
    range_length = r - l + 1

    # Create a bitmask with `range_length` consecutive 1s.
    # For example, if range_length is 3, this creates binary 111.
    block_of_ones = (1 << range_length) - 1

    # Shift the block of 1s to the correct position to form the final mask.
    # The range starts at position `l`, so we shift left by `l - 1`.
    mask = block_of_ones << (l - 1)

    # Check if the bits in `n` within the mask are all set.
    # This is true if `(n & mask)` is equal to the `mask` itself.
    return (n & mask) == mask
```