**Describe what's wrong**
INTERPOLATE doesn't work for tables with ENGINE = MergeTree

**Does it reproduce on recent release?**
yes

**How to reproduce**
```
CREATE TABLE t1 (n Int32) ENGINE = MergeTree ORDER BY n;
INSERT INTO t1 VALUES (1),(3),(3),(6),(6),(6);

SELECT
    n,
    count() AS m
FROM t1
GROUP BY n
ORDER BY n ASC WITH FILL
INTERPOLATE ( m AS m + 1 );

Received exception from server (version 22.5.1):
Code: 47. DB::Exception: Received from localhost:9000. DB::Exception: Missing columns: 'm' while processing query: 'SELECT n, count() FROM t1 GROUP BY n ORDER BY n ASC WITH FILL INTERPOLATE ( m AS m + 1 )', required columns: 'n' 'm', maybe you meant: ['n','n']. (UNKNOWN_IDENTIFIER)
```

**Expected behavior**
same as
```
CREATE TABLE t1 (n Int32) ENGINE = Memory;
INSERT INTO t1 VALUES (1),(3),(3),(6),(6),(6);

SELECT
    n,
    count() AS m
FROM t1
GROUP BY n
ORDER BY n ASC WITH FILL
INTERPOLATE ( m AS m + 1 );

┌─n─┬─m─┐
│ 1 │ 1 │
│ 2 │ 2 │
│ 3 │ 2 │
│ 4 │ 3 │
│ 5 │ 4 │
│ 6 │ 3 │
└───┴───┘
```

**Error message and/or stacktrace**
```
Received exception from server (version 22.5.1):
Code: 47. DB::Exception: Received from localhost:9000. DB::Exception: Missing columns: 'm' while processing query: 'SELECT n, count() FROM t1 GROUP BY n ORDER BY n ASC WITH FILL INTERPOLATE ( m AS m + 1 )', required columns: 'n' 'm', maybe you meant: ['n','n']. (UNKNOWN_IDENTIFIER)
```

**Additional context**
INTERPOLATE is a new feature added in #35349
{
    DataPartsVector parts = getDataPartsVectorForInternalUsage();
    std::vector<std::pair<Int64, Int64>> all_block_numbers_on_disk;
    std::vector<std::pair<Int64, Int64>> block_numbers_on_disk;
    for (const auto & part : parts)
        if (part->isStoredOnDisk())
            all_block_numbers_on_disk.emplace_back(part->info.min_block, part->info.max_block);
    if (all_block_numbers_on_disk.empty())
        return 0;
    ::sort(all_block_numbers_on_disk.begin(), all_block_numbers_on_disk.end());
    block_numbers_on_disk.push_back(all_block_numbers_on_disk[0]);
    for (size_t i = 1; i < all_block_numbers_on_disk.size(); ++i)
    {
        if (all_block_numbers_on_disk[i].first == all_block_numbers_on_disk[i - 1].second + 1)
            block_numbers_on_disk.back().second = all_block_numbers_on_disk[i].second;
        else
            block_numbers_on_disk.push_back(all_block_numbers_on_disk[i]);
    }
    auto is_range_on_disk = [&block_numbers_on_disk](Int64 min_block, Int64 max_block)
    {
        auto lower = std::lower_bound(block_numbers_on_disk.begin(), block_numbers_on_disk.end(), std::make_pair(min_block, Int64(-1L)));
        if (lower != block_numbers_on_disk.end() && min_block >= lower->first && max_block <= lower->second)