Problem: Friday is Polycarpus' favourite day of the week. Not because it is followed by the weekend, but because the lessons on Friday are 2 IT lessons, 2 math lessons and 2 literature lessons. Of course, Polycarpus has prepared to all of them, unlike his buddy Innocentius. Innocentius spent all evening playing his favourite game Fur2 and didn't have enough time to do the literature task. As Innocentius didn't want to get an F, he decided to do the task and read the book called "Storm and Calm" during the IT and Math lessons (he never used to have problems with these subjects). When the IT teacher Mr. Watkins saw this, he decided to give Innocentius another task so that the boy concentrated more on the lesson and less — on the staff that has nothing to do with IT. 

Mr. Watkins said that a palindrome is a string that can be read the same way in either direction, from the left to the right and from the right to the left. A concatenation of strings a, b is a string ab that results from consecutive adding of string b to string a. Of course, Innocentius knew it all but the task was much harder than he could have imagined. Mr. Watkins asked change in the "Storm and Calm" the minimum number of characters so that the text of the book would also be a concatenation of no more than k palindromes. Innocentius can't complete the task and therefore asks you to help him.

Input

The first input line contains a non-empty string s which is the text of "Storm and Calm" (without spaces). The length of the string s does not exceed 500 characters. String s consists of uppercase and lowercase Latin letters. The second line contains a single number k (1 ≤ k ≤ |s|, where |s| represents the length of the string s).

Output

Print on the first line the minimum number of changes that Innocentius will have to make. Print on the second line the string consisting of no more than k palindromes. Each palindrome should be non-empty and consist of uppercase and lowercase Latin letters. Use the character "+" (ASCII-code 43) to separate consecutive palindromes. If there exist several solutions, print any of them.

The letters' case does matter, that is an uppercase letter is not considered equivalent to the corresponding lowercase letter.

Examples

Input

abacaba
1


Output

0
abacaba


Input

abdcaba
2


Output

1
abdcdba


Input

abdcaba
5


Output

0
a+b+d+c+aba


Input

abacababababbcbabcd
3


Output

1
abacaba+babab+bcbabcb

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long one = 1;
const long long INF = 2e18;
const long long MOD = 1e9 + 7;
const long long N = 510;
const long long nul = 0;
const long long SIZE = 1e6 * 3;
long long cost[N][N];
long long dp[N][N];
long long pref[N][N];
string s;
void solve(long long l, long long r) {
  string ans;
  for (long long i = l; i <= r; i++) {
    ans += s[i];
  }
  long long n = ans.size();
  for (long long i = 0; i < n / 2; i++) {
    if (ans[i] != ans[n - i - 1]) {
      ans[i] = ans[n - i - 1];
    }
  }
  cout << ans;
}
signed main() {
  cin >> s;
  long long k;
  cin >> k;
  long long n = s.size();
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) {
      cost[i][j] = INF;
    }
  }
  for (long long i = 0; i < n; i++) {
    cost[i][i] = 0;
  }
  for (long long i = 0; i < n - 1; i++) {
    if (s[i] == s[i + 1]) {
      cost[i][i + 1] = 0;
    } else
      cost[i][i + 1] = 1;
  }
  for (long long len = 3; len <= n; len++) {
    for (long long i = 0; i < n - len + 1; i++) {
      long long j = i + len - 1;
      if (s[i] == s[j]) {
        cost[i][j] = cost[i + 1][j - 1];
      } else {
        cost[i][j] = cost[i + 1][j - 1] + 1;
      }
    }
  }
  for (long long i = 0; i < n; i++) {
    for (long long j = 1; j <= n; j++) {
      dp[i][j] = INF;
      pref[i][j] = -1;
    }
  }
  dp[0][1] = 0;
  for (long long i = 1; i < n; i++) {
    for (long long j = 1; j <= min(i + 1, k); j++) {
      if (j == 1) {
        dp[i][j] = cost[0][i];
      } else {
        for (long long i2 = 0; i2 <= i; i2++) {
          if (dp[i2][j - 1] + cost[i2 + 1][i] < dp[i][j]) {
            dp[i][j] = dp[i2][j - 1] + cost[i2 + 1][i];
            pref[i][j] = i2;
          }
        }
      }
    }
  }
  cout << dp[n - 1][k] << endl;
  vector<pair<long long, long long> > ans;
  long long i1 = n - 1, j1 = k;
  while (j1 > 0) {
    if (j1 == 1) {
      ans.push_back({0, i1});
      break;
    } else if (dp[i1][j1] == cost[0][i1]) {
      ans.push_back({0, i1});
      break;
    } else {
      for (long long i2 = 0; i2 < i1; i2++) {
        if (dp[i2][j1 - 1] + cost[i2 + 1][i1] == dp[i1][j1]) {
          ans.push_back({i2 + 1, i1});
          i1 = i2;
          j1--;
        }
      }
    }
  }
  reverse((ans).begin(), (ans).end());
  for (long long i = 0; i < ans.size(); i++) {
    solve(ans[i].first, ans[i].second);
    if (i < ans.size() - 1) {
      cout << "+";
    }
  }
}