Vertical merges of wide parts fail if there is an array in the table and not all columns are present in parts.
```sql
CREATE TABLE aaa 
(
  a   Array(Int16),
  b   Int8
)
ENGINE = MergeTree
ORDER BY tuple() 
settings
    vertical_merge_algorithm_min_columns_to_activate=1,
    vertical_merge_algorithm_min_rows_to_activate=1,
    min_bytes_for_wide_part=0;

insert into aaa select [], 0;
alter table aaa clear column b;

optimize table aaa final;

Received exception from server (version 22.4.2):
Code: 16. DB::Exception: Received from localhost:9000. 
DB::Exception: There is no column a.size0 in table. (NO_SUCH_COLUMN_IN_TABLE)
```
{
    std::vector<size_t> per_part_sum_marks;
    Block sample_block = storage_snapshot->metadata->getSampleBlock();
    is_part_on_remote_disk.resize(parts.size());
    for (const auto i : collections::range(0, parts.size()))
    {
        const auto & part = parts[i];
        bool part_on_remote_disk = part.data_part->isStoredOnRemoteDisk();
        is_part_on_remote_disk[i] = part_on_remote_disk;
        do_not_steal_tasks |= part_on_remote_disk;
        //
        size_t sum_marks = 0;
        for (const auto & range : part.ranges)
            sum_marks += range.end - range.begin;
        per_part_sum_marks.push_back(sum_marks);
        auto task_columns = getReadTaskColumns(data, storage_snapshot, part.data_part, column_names, prewhere_info);
        auto size_predictor = !predict_block_size_bytes ? nullptr
            : MergeTreeBaseSelectProcessor::getSizePredictor(part.data_part, task_columns, sample_block);
        per_part_size_predictor.emplace_back(std::move(size_predictor));
        //
        const auto & required_column_names = task_columns.columns.getNames();
        per_part_column_name_set.emplace_back(required_column_names.begin(), required_column_names.end());
        per_part_pre_columns.push_back(std::move(task_columns.pre_columns));
        per_part_columns.push_back(std::move(task_columns.columns));
        per_part_should_reorder.push_back(task_columns.should_reorder);
        parts_with_idx.push_back({ part.data_part, part.part_index_in_query });
    }
    return per_part_sum_marks;
}
void MergeTreeReadPool::fillPerThreadInfo(