**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
}
    while (!parts_queue.empty())
    {
        assert(!threads_queue.empty());
        size_t i = threads_queue.front();
        auto & need_parts = parts_per_thread[i];
        assert(need_parts > 0);
        auto & thread_parts = threads_parts[i];
        auto & current_parts = parts_queue.front();
        assert(!current_parts.empty());
        auto parts_to_grab = std::min(need_parts, current_parts.size());
        thread_parts.insert(thread_parts.end(), current_parts.end() - parts_to_grab, current_parts.end());
        current_parts.resize(current_parts.size() - parts_to_grab);
        need_parts -= parts_to_grab;
        
        
        
        
        if (!current_parts.empty())
            parts_queue.push(std::move(current_parts));
        parts_queue.pop();
        
        if (need_parts > 0)
            threads_queue.push(i);
        threads_queue.pop();
    }
    assert(threads_queue.empty());
    assert(std::all_of(threads_parts.begin(), threads_parts.end(), [](const std::vector<std::pair<String, DiskPtr>> & parts)
    {
        return !parts.empty();