Students in Railway Carriage (贪心)

There are n

consecutive seat places in a railway carriage. Each place is either empty or occupied by a passenger.

The university team for the Olympiad consists of a

student-programmers and b student-athletes. Determine the largest number of students from all a+b

students, which you can put in the railway carriage so that:

• no student-programmer is sitting next to the student-programmer;
• and no student-athlete is sitting next to the student-athlete.

In the other words, there should not be two consecutive (adjacent) places where two student-athletes or two student-programmers are sitting.

Consider that initially occupied seat places are occupied by jury members (who obviously are not students at all).

Input

The first line contain three integers n

, a and b ( 1≤n≤2⋅105, 0≤a,b≤2⋅105, a+b>0

) — total number of seat places in the railway carriage, the number of student-programmers and the number of student-athletes.

The second line contains a string with length n

, consisting of characters "." and "*". The dot means that the corresponding place is empty. The asterisk means that the corresponding place is occupied by the jury member.

Output

Print the largest number of students, which you can put in the railway carriage so that no student-programmer is sitting next to a student-programmer and no student-athlete is sitting next to a student-athlete.

Examples

Input

5 1 1
*...*

Output

2

Input

6 2 3
*...*.

Output

4

Input

11 3 10
.*....**.*.

Output

7

Input

3 2 3
***

Output

0

Note

In the first example you can put all student, for example, in the following way: *.AB*

In the second example you can put four students, for example, in the following way: *BAB*B

In the third example you can put seven students, for example, in the following way: B*ABAB**A*B

The letter A means a student-programmer, and the letter B — student-athlete.

题意：要在n个座位上安排a名A类同学，b名B类同学，要求不能同类的同学坐在一起，而且只能安排在'.'(空位置)上求最大能安排的同学数量

#include<cstdio>
#include<cstring>
using namespace std;
const int N = 2e5+10;
char str[N];
int main(){
	int n,a,b;
	scanf("%d%d%d%s",&n,&a,&b,str);
	int ans=0;
	int flag=0,last=0;//last=1上一个是a,last=-1 上一个是b 
	for(int i=0;i<n;i++){
		if(str[i]=='*'){
			flag=0;
			continue;
		}
		if(!flag){  //开始放 a,b中小的 
			if(a>b){
			   a--;
			   ans++;
			   flag=1;
			   last=1;	
			}
			else if(a<b){
				b--;
				ans++;
				flag=1;
				last=-1;
			}
			else{
				if(a==0) break;
				else{
					a--;
					ans++;
					flag=1;
					last=1;
				}
			}
		}
		else{
			if(last==1){   //上一个是a，放b 
				if(b>0){
					b--;
					ans++;
					last=-1;
				}
				else last=-1; //不能放空着，假装放b	
			}
			else{
				if(a>0){
					a--;
					ans++;
					last=1;
				}
				else last=1;
			}
		}
	}
	printf("%d\n",ans);
	return 0;
}