Due to the increase in the number of students of Berland State University it was decided to equip a new computer room. You were given the task of buying mouses, and you have to spend as little as possible. After all, the country is in crisis!

The computers bought for the room were different. Some of them had only USB ports, some — only PS/2 ports, and some had both options.

You have found a price list of a certain computer shop. In it, for m mouses it is specified the cost and the type of the port that is required to plug the mouse in (USB or PS/2). Each mouse from the list can be bought at most once.

You want to buy some set of mouses from the given price list in such a way so that you maximize the number of computers equipped with mouses (it is not guaranteed that you will be able to equip all of the computers), and in case of equality of this value you want to minimize the total cost of mouses you will buy.

Input

The first line contains three integers a, b and c (0 ≤ a, b, c ≤ 105) — the number of computers that only have USB ports, the number of computers, that only have PS/2 ports, and the number of computers, that have both options, respectively.

The next line contains one integer m (0 ≤ m ≤ 3·105) — the number of mouses in the price list.

The next m lines each describe another mouse. The i-th line contains first integer vali (1 ≤ vali ≤ 109) — the cost of the i-th mouse, then the type of port (USB or PS/2) that is required to plug the mouse in.

Output

Output two integers separated by space — the number of equipped computers and the total cost of the mouses you will buy.

Example

Input

2 1 1
4
5 USB
6 PS/2
3 PS/2
7 PS/2


Output

3 14

Note

In the first example you can buy the first three mouses. This way you will equip one of the computers that has only a USB port with a USB mouse, and the two PS/2 mouses you will plug into the computer with PS/2 port and the computer with both ports.
    import javax.print.DocFlavor;
    import java.beans.IntrospectionException;
    import java.io.*;
    import java.lang.reflect.Array;
    import java.math.BigInteger;
    import java.util.*;
    import java.lang.*;
    import static java.lang.Math.*;
    public class main implements Runnable {

        public static void main(String[] args) {
            new Thread(null, new main(), "Check2", 1 << 28).start();// to increse stack size in java
        }
        void init(ArrayList <Integer> adj[],int n){
            for(int i=0;i<=n;i++)adj[i]=new ArrayList<>();
        }
        static long mod = (long) (1e9 + 7);
        public void run() {
            InputReader in = new InputReader(System.in);
            PrintWriter w = new PrintWriter(System.out);


            int a=in.nextInt();
            int b=in.nextInt();
            int c=in.nextInt();
            ArrayList <Long> usb=new ArrayList<>();
            ArrayList <Long> ps2=new ArrayList<>();
            int m=in.nextInt();
            for(int i=0;i<m;i++){
                long cost=in.nextLong();
                String s=in.next();

                if(s.equals("USB"))usb.add(cost);
                else
                    ps2.add(cost);
            }
            Collections.sort(usb);
            Collections.sort(ps2);
            int p1=0;
            int p2=0;
            long ans=0;
            int comp=0;
            ArrayList <Long> tmp=new ArrayList<>();
            for(int i=0;i<min(usb.size(),a);i++){
                ans=ans+usb.get(i);
                comp++;
                p1++;
            }
            for(int i=0;i<min(ps2.size(),b);i++){
                ans=ans+ps2.get(i);
                comp++;
                p2++;
            }
            for(int i=p1;i<usb.size();i++){
                tmp.add(usb.get(i));
            }
            for(int i=p2;i<ps2.size();i++){
                tmp.add(ps2.get(i));
            }
            Collections.sort(tmp);

            for(int i=0;i<min(tmp.size(),c);i++){
                ans=ans+tmp.get(i);
                comp++;

            }

            w.println(comp+" "+ans);
            w.close();
        }
        static void diji(int s, long dist[], ArrayList<pair> adj[]) {
            dist[s] = 0;
            PriorityQueue<pair> q = new PriorityQueue<>(new cmp());
            q.add(new pair(s, 0));
            while (!q.isEmpty()) {
                pair p1 = q.poll();
                for (pair ne : adj[p1.a]) {

                    if ((long) p1.b + (long) ne.b < dist[ne.a]) {
                        dist[ne.a] = (long) p1.b + (long) ne.b;
                        pair p2 = new pair(ne.a, dist[ne.a]);
                        q.add(p2);

                    }

                }
            }

        }
        static class cmp implements Comparator<pair>{

            public  int compare(pair o1,pair o2)
            {
                return o1.b<o2.b?-1:o1.b>o2.b?1:0;
            }

        }

        static class pair {
            int a;
            long b;
            pair(int a,long b){
                this.a=a;
                this.b=b;
            }
            public boolean equals(Object obj) {      //  override equals method for object to remove tem from arraylist and sets etc.......
                if (this == obj)
                    return true;
                if (obj == null)
                    return false;
                if (getClass() != obj.getClass())
                    return false;
                pair other = (pair) obj;
                if (b!= other.b||a!=other.a)
                    return false;
                return true;
            }
        }

        static long modinv(long a,long b)
        {
            long p=power(b,mod-2);

            p=a%mod*p%mod;
            p%=mod;

            return p;

        }

        static long power(long x,long y){
            if(y==0)return 1%mod;
            if(y==1)return x%mod;


            long res=1;
            x=x%mod;
            while(y>0){


                if((y%2)!=0){
                    res=(res*x)%mod;
                }


                y=y/2;
                x=(x*x)%mod;
            }


            return res;

        }
        static  long gcd(long a,long b){

            if(b==0)return a;
            return gcd(b,a%b);
        }

        static  void sev(int a[],int n){

            for(int i=2;i<=n;i++)a[i]=i;
            for(int i=2;i<=n;i++){

                if(a[i]!=0){
                    for(int j=2*i;j<=n;){

                        a[j]=0;
                        j=j+i;
                    }
                }

            }

        }



        static class InputReader
        {
            private InputStream stream;
            private byte[] buf = new byte[1024];
            private int curChar;
            private int numChars;
            private SpaceCharFilter filter;

            public InputReader(InputStream stream)
            {
                this.stream = stream;
            }

            public int read()
            {
                if (numChars==-1)
                    throw new InputMismatchException();

                if (curChar >= numChars)
                {
                    curChar = 0;
                    try
                    {
                        numChars = stream.read(buf);
                    }
                    catch (IOException e)
                    {
                        throw new InputMismatchException();
                    }

                    if(numChars <= 0)
                        return -1;
                }
                return buf[curChar++];
            }

            public String nextLine()
            {
                BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
                String str = "";
                try
                {
                    str = br.readLine();
                }
                catch (IOException e)
                {
                    e.printStackTrace();
                }
                return str;
            }
            public int nextInt()
            {
                int c = read();

                while(isSpaceChar(c))
                    c = read();

                int sgn = 1;

                if (c == '-')
                {
                    sgn = -1;
                    c = read();
                }

                int res = 0;
                do
                {
                    if(c<'0'||c>'9')
                        throw new InputMismatchException();
                    res *= 10;
                    res += c - '0';
                    c = read();
                }
                while (!isSpaceChar(c));

                return res * sgn;
            }

            public long nextLong()
            {
                int c = read();
                while (isSpaceChar(c))
                    c = read();
                int sgn = 1;
                if (c == '-')
                {
                    sgn = -1;
                    c = read();
                }
                long res = 0;

                do
                {
                    if (c < '0' || c > '9')
                        throw new InputMismatchException();
                    res *= 10;
                    res += c - '0';
                    c = read();
                }
                while (!isSpaceChar(c));
                return res * sgn;
            }

            public double nextDouble()
            {
                int c = read();
                while (isSpaceChar(c))
                    c = read();
                int sgn = 1;
                if (c == '-')
                {
                    sgn = -1;
                    c = read();
                }
                double res = 0;
                while (!isSpaceChar(c) && c != '.')
                {
                    if (c == 'e' || c == 'E')
                        return res * Math.pow(10, nextInt());
                    if (c < '0' || c > '9')
                        throw new InputMismatchException();
                    res *= 10;
                    res += c - '0';
                    c = read();
                }
                if (c == '.')
                {
                    c = read();
                    double m = 1;
                    while (!isSpaceChar(c))
                    {
                        if (c == 'e' || c == 'E')
                            return res * Math.pow(10, nextInt());
                        if (c < '0' || c > '9')
                            throw new InputMismatchException();
                        m /= 10;
                        res += (c - '0') * m;
                        c = read();
                    }
                }
                return res * sgn;
            }

            public String readString()
            {
                int c = read();
                while (isSpaceChar(c))
                    c = read();
                StringBuilder res = new StringBuilder();
                do
                {
                    res.appendCodePoint(c);
                    c = read();
                }
                while (!isSpaceChar(c));

                return res.toString();
            }

            public boolean isSpaceChar(int c)
            {
                if (filter != null)
                    return filter.isSpaceChar(c);
                return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
            }

            public String next()
            {
                return readString();
            }

            public interface SpaceCharFilter
            {
                public boolean isSpaceChar(int ch);
            }
        }







    }
