Ancient Egyptians are known to have understood difficult concepts in mathematics. The ancient Egyptian mathematician Ahmes liked to write a kind of arithmetic expressions on papyrus paper which he called as Ahmes arithmetic expression.

An Ahmes arithmetic expression can be defined as: 

  * "d" is an Ahmes arithmetic expression, where d is a one-digit positive integer; 
  * "(E1 op E2)" is an Ahmes arithmetic expression, where E1 and E2 are valid Ahmes arithmetic expressions (without spaces) and op is either plus ( + ) or minus ( - ). 

For example 5, (1-1) and ((1+(2-3))-5) are valid Ahmes arithmetic expressions.

On his trip to Egypt, Fafa found a piece of papyrus paper having one of these Ahmes arithmetic expressions written on it. Being very ancient, the papyrus piece was very worn out. As a result, all the operators were erased, keeping only the numbers and the brackets. Since Fafa loves mathematics, he decided to challenge himself with the following task:

Given the number of plus and minus operators in the original expression, find out the maximum possible value for the expression on the papyrus paper after putting the plus and minus operators in the place of the original erased operators.

Input

The first line contains a string E (1 ≤ |E| ≤ 104) — a valid Ahmes arithmetic expression. All operators are erased and replaced with '?'.

The second line contains two space-separated integers P and M (0 ≤ min(P, M) ≤ 100) — the number of plus and minus operators, respectively. 

It is guaranteed that P + M =  the number of erased operators.

Output

Print one line containing the answer to the problem.

Examples

Input

(1?1)
1 0


Output

2


Input

(2?(1?2))
1 1


Output

1


Input

((1?(5?7))?((6?2)?7))
3 2


Output

18


Input

((1?(5?7))?((6?2)?7))
2 3


Output

16

Note

  * The first sample will be (1 + 1) = 2. 
  * The second sample will be (2 + (1 - 2)) = 1. 
  * The third sample will be ((1 - (5 - 7)) + ((6 + 2) + 7)) = 18. 
  * The fourth sample will be ((1 + (5 + 7)) - ((6 - 2) - 7)) = 16. 
#include <bits/stdc++.h>
using namespace std;
int num, f[11000][110], g[11000][110];
int p, m;
int n, flag;
char s[110000];
stack<int> st;
const int inf = 1e9;
void update(int x, int l, int r) {
  if (flag) {
    for (int i = 0; i <= p; i++)
      if (f[l][i] == inf)
        continue;
      else {
        for (int j = 0; j <= p - i - 1; j++)
          if (f[r][j] == inf)
            continue;
          else {
            if (f[x][i + j + 1] == inf || f[l][i] + f[r][j] > f[x][i + j + 1])
              f[x][i + j + 1] = f[l][i] + f[r][j];
          }
        for (int j = 0; j <= p - i; j++)
          if (g[r][j] == inf)
            continue;
          else {
            if (f[x][i + j] == inf || f[l][i] - g[r][j] > f[x][i + j])
              f[x][i + j] = f[l][i] - g[r][j];
          }
      }
    for (int i = 0; i <= p; i++)
      if (g[l][i] == inf)
        continue;
      else {
        for (int j = 0; j <= p - i - 1; j++)
          if (g[r][j] == inf)
            continue;
          else {
            if (g[x][i + j + 1] == inf || g[l][i] + g[r][j] < g[x][i + j + 1])
              g[x][i + j + 1] = g[l][i] + g[r][j];
          }
        for (int j = 0; j <= p - i; j++)
          if (f[r][j] == inf)
            continue;
          else {
            if (g[x][i + j] == inf || g[l][i] - f[r][j] < g[x][i + j])
              g[x][i + j] = g[l][i] - f[r][j];
          }
      }
  } else {
    for (int i = 0; i <= m; i++)
      if (f[l][i] == inf)
        continue;
      else {
        for (int j = 0; j <= m - i; j++)
          if (f[r][j] == inf)
            continue;
          else {
            if (f[x][i + j] == inf || f[l][i] + f[r][j] > f[x][i + j])
              f[x][i + j] = f[l][i] + f[r][j];
          }
        for (int j = 0; j <= m - i - 1; j++)
          if (g[r][j] == inf)
            continue;
          else {
            if (f[x][i + j + 1] == inf || f[l][i] - g[r][j] > f[x][i + j + 1])
              f[x][i + j + 1] = f[l][i] - g[r][j];
          }
      }
    for (int i = 0; i <= m; i++)
      if (g[l][i] == inf)
        continue;
      else {
        for (int j = 0; j <= m - i; j++)
          if (g[r][j] == inf)
            continue;
          else {
            if (g[x][i + j] == inf || g[l][i] + g[r][j] < g[x][i + j])
              g[x][i + j] = g[l][i] + g[r][j];
          }
        for (int j = 0; j <= m - i - 1; j++)
          if (f[r][j] == inf)
            continue;
          else {
            if (g[x][i + j + 1] == inf || g[l][i] - f[r][j] < g[x][i + j + 1])
              g[x][i + j + 1] = g[l][i] - f[r][j];
          }
      }
  }
}
int main() {
  scanf("%s", s);
  n = strlen(s);
  scanf("%d %d", &p, &m);
  for (int i = 1; i <= n; i++)
    for (int j = 0; j <= 100; j++) f[i][j] = g[i][j] = inf;
  if (m <= 100)
    flag = 0;
  else
    flag = 1;
  for (int i = 0; i < n; i++) {
    if (s[i] == '(') {
      num++;
      st.push(num);
    } else if (s[i] >= '0' && s[i] <= '9') {
      num++;
      st.push(num);
      f[num][0] = g[num][0] = s[i] - '0';
    } else if (s[i] == ')') {
      int l, r, x;
      r = st.top(), st.pop();
      l = st.top(), st.pop();
      x = st.top();
      update(x, l, r);
    }
  }
  if (flag)
    printf("%d\n", f[1][p]);
  else
    printf("%d\n", f[1][m]);
  return 0;
}
