#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,a,b) for(it i=(it)(a);i<=(it)b;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define moda 998244353LL
#define modb 1000000007LL
#define dai 2500000000000000000LL
#define tyu 2500000000
#define sho -dai
#define eps 1e-14
#define yn(x) cout<<(x ? "Yes":"No")<<endl;
#define YN(x) cout<<(x ? "YES":"NO")<<endl;
using it=long long;
using un=unsigned long long;
using db=long double;
using st=string;
using ch=char;
using bo=bool;
using P=pair<it,it>;
using T=tuple<it,it,it>;
using vi=vector<it>;
using vd=vector<db>;
using vs=vector<st>;
using vc=vector<ch>;
using vb=vector<bo>;
using vp=vector<P>;
using sp=set<P>;
using ss=set<st>;
using si=set<it>;
using vvi=vector<vi>;
using vvd=vector<vd>;
using vvs=vector<vs>;
using vvb=vector<vb>;
using vvc=vector<vc>;
using vvp=vector<vp>;
using vsi=vector<si>;
using vsp=vector<sp>;
using vvsi=vector<vsi>;
using vvsp=vector<vsp>;
using vvvi=vector<vvi>;
using vvvd=vector<vvd>;
using vvvvi=vector<vvvi>;
using mint=modint;
const it dx[4]={0,1,0,-1};
const it dy[4]={1,0,-1,0};

int main(){
  it g,c,p;st s;cin>>g>>c>>p>>s;
  it n=g+c+p;
  vvvi dp(n+1,vvi(g+1,vi(c+1,sho)));
  dp[0][0][0]=0;
  rep(i,0,n-1)
    rep(j,0,g)
      rep(k,0,c){
        if(dp[i][j][k]==dai)continue;
        if(s[i]=='G'){
          if(j!=g)dp[i+1][j+1][k]=max(dp[i+1][j+1][k],dp[i][j][k]+1);
          if(k!=c)dp[i+1][j][k+1]=max(dp[i+1][j][k+1],dp[i][j][k]);
          if(i-j-k!=p)dp[i+1][j][k]=max(dp[i+1][j][k],dp[i][j][k]+3);
        }
        if(s[i]=='C'){
          if(j!=g)dp[i+1][j+1][k]=max(dp[i+1][j+1][k],dp[i][j][k]+3);
          if(k!=c)dp[i+1][j][k+1]=max(dp[i+1][j][k+1],dp[i][j][k]+1);
          if(i-j-k!=p)dp[i+1][j][k]=max(dp[i+1][j][k],dp[i][j][k]);
        }
        if(s[i]=='P'){
          if(j!=g)dp[i+1][j+1][k]=max(dp[i+1][j+1][k],dp[i][j][k]);
          if(k!=c)dp[i+1][j][k+1]=max(dp[i+1][j][k+1],dp[i][j][k]+3);
          if(i-j-k!=p)dp[i+1][j][k]=max(dp[i+1][j][k],dp[i][j][k]+1);
        }
      }
  cout<<dp[n][g][c]<<endl;
}