#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
long long int t, n, m, mi[505][505] = {0}, dp[505][505], pos[505][505];
vector<string> v;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int i, j, k, x, y;
  string s;
  cin >> s >> m;
  s = " " + s;
  n = ((long long int)s.size());
  for (i = 0; i < 505; i++) {
    for (j = 0; j < 505; j++) mi[i][j] = dp[i][j] = 1e10;
  }
  dp[0][0] = 0;
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= i; j++) {
      long long int st = j, en = i, cnt = 0;
      while (st < en) {
        if (s[st] != s[en]) cnt++;
        st++;
        en--;
      }
      mi[j][i] = cnt;
    }
  }
  for (i = 1; i < n; i++) {
    for (k = 1; k <= m; k++) {
      long long int mx = 1e10;
      for (j = 1; j <= i; j++) {
        if (mx > (mi[j][i] + dp[j - 1][k - 1])) {
          mx = (mi[j][i] + dp[j - 1][k - 1]);
          pos[i][k] = j;
        }
      }
      dp[i][k] = mx;
    }
  }
  long long int ans = 1e10;
  j = n - 1;
  for (i = 1; i <= m; i++) {
    if (ans > dp[n - 1][i]) {
      ans = dp[n - 1][i];
      k = i;
    }
  }
  cout << ans << '\n';
  while (1) {
    long long int idx = pos[j][k];
    long long int st = idx, en = j;
    while (st < en) {
      s[st] = s[en];
      st++;
      en--;
    }
    v.push_back(s.substr(idx, j - idx + 1));
    k--;
    j = idx - 1;
    if (j == 0 || k < 0) break;
  }
  reverse(v.begin(), v.end());
  for (i = 0; i < v.size() - 1; i++) cout << v[i] << "+";
  cout << v.back();
  return 0;
}
