**Describe the bug**
Setting `transform_null_in` works incorrectly with `IN` operator over tuples.

**How to reproduce**
1.
```
CREATE TABLE null_in_1 (u UInt32, n Nullable(UInt32)) ENGINE = Memory;
INSERT INTO null_in_1 VALUES (1, NULL), (2, 2), (3, NULL), (4, 4), (5, NULL);
```

```
SET transform_null_in = 1;
SELECT count() FROM null_in_1 WHERE (u, n) IN ((42, NULL));

┌─count()─┐
│       3 │
└─────────┘
```

It interprets all rows, where `n` is `NULL` as matched, despite the value of `u`.


2.
```
CREATE TABLE null_in_1 (a Nullable(UInt32), b Nullable(UInt32)) ENGINE = Memory;
INSERT INTO null_in_1 VALUES (1, NULL) (0, NULL) (NULL, NULL) (NULL, 1) (NULL, 0) (0, 0) (1, 1);
```

```
SET transform_null_in = 1;
SELECT count() FROM null_in_1 WHERE (a, b) IN (0, NULL);

┌─count()─┐
│       3 │
└─────────┘

SELECT count() FROM null_in_1 WHERE (a, b) IN (NULL, 0);

┌─count()─┐
│       3 │
└─────────┘

SELECT count() FROM null_in_1 WHERE (a, b) IN (0, 0);

┌─count()─┐
│       3 │
└─────────┘
```

It doesn't see the difference between default value and null value.

* 2: the range contains elements not in the set
  */
BoolMask MergeTreeSetIndex::checkInRange(const std::vector<Range> & key_ranges, const DataTypes & data_types) const
{
    size_t tuple_size = indexes_mapping.size();
    ColumnsWithInfinity left_point;
    ColumnsWithInfinity right_point;
    left_point.reserve(tuple_size);
    right_point.reserve(tuple_size);
    for (size_t i = 0; i < tuple_size; ++i)
    {
        left_point.emplace_back(ordered_set[i]->cloneEmpty());
        right_point.emplace_back(ordered_set[i]->cloneEmpty());
    }
    bool invert_left_infinities = false;
    bool invert_right_infinities = false;
    for (size_t i = 0; i < tuple_size; ++i)
    {
        std::optional<Range> new_range = KeyCondition::applyMonotonicFunctionsChainToRange(
            key_ranges[indexes_mapping[i].key_index],
            indexes_mapping[i].functions,
            data_types[indexes_mapping[i].key_index]);
        if (!new_range)
            return {true, true};
        /** A range that ends in (x, y, ..., +inf) exclusive is the same as a range
          * that ends in (x, y, ..., -inf) inclusive and vice versa for the left bound.
          */
        if (new_range->left_bounded)
        {
            if (!new_range->left_included)