In a small restaurant there are a tables for one person and b tables for two persons.

It it known that n groups of people come today, each consisting of one or two people.

If a group consist of one person, it is seated at a vacant one-seater table. If there are none of them, it is seated at a vacant two-seater table. If there are none of them, it is seated at a two-seater table occupied by single person. If there are still none of them, the restaurant denies service to this group.

If a group consist of two people, it is seated at a vacant two-seater table. If there are none of them, the restaurant denies service to this group.

You are given a chronological order of groups coming. You are to determine the total number of people the restaurant denies service to.

The first line contains three integers n, a and b (1 ≤ n ≤ 2·10⁵, 1 ≤ a, b ≤ 2·10⁵) — the number of groups coming to the restaurant, the number of one-seater and the number of two-seater tables.

The second line contains a sequence of integers t₁, t₂, ..., t_n (1 ≤ t_i ≤ 2) — the description of clients in chronological order. If t_i is equal to one, then the i-th group consists of one person, otherwise the i-th group consists of two people.

Print the total number of people the restaurant denies service to.