#include <bits/stdc++.h>
long long mpow(long long a, long long n, long long mod) {
  long long ret = 1;
  long long b = a;
  while (n) {
    if (n & 1) ret = (ret * b) % mod;
    b = (b * b) % mod;
    n >>= 1;
  }
  return (long long)ret;
}
using namespace std;
int dp1[502][502], dp2[502][502], n, k;
string s;
vector<string> ans;
void make(int x, int y) {
  string sub = s.substr(x, y - x + 1);
  for (int i = 0; i < sub.size() / 2; i++) {
    if (sub[i] != sub[(int)sub.size() - 1 - i]) {
      sub[i] = sub[(int)sub.size() - 1 - i];
    }
  }
  ans.push_back(sub);
}
int getans(int i, int num) {
  if (num > k) return 1e9;
  if (i == n + 1) {
    return 0;
  }
  if (dp2[i][num] != -1) return dp2[i][num];
  int &ret = dp2[i][num];
  ret = 1e9;
  for (int j = i; j <= n; j++) {
    ret = min(ret, dp1[i][j] + getans(j + 1, num + 1));
  }
  return ret;
}
void trace(int i, int num) {
  if (i == n + 1) return;
  int val = getans(i, num);
  for (int j = i; j <= n; j++) {
    if (dp1[i][j] + getans(j + 1, num + 1) == val) {
      make(i, j);
      trace(j + 1, num + 1);
      return;
    }
  }
}
void solve() {
  cin >> s;
  n = s.size();
  s = '#' + s;
  scanf("%d", &k);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      dp1[i][j] = 1e9;
    }
  }
  for (int i = 1; i <= n; i++) {
    dp1[i][i] = 0;
    if (i <= n - 1 && s[i] == s[i + 1]) {
      dp1[i][i + 1] = 0;
    } else {
      dp1[i][i + 1] = 1;
    }
  }
  for (int j = 3; j <= n; j++) {
    for (int i = 1; i <= n; i++) {
      if (i + (j - 1) > n) continue;
      if (s[i] == s[i + (j - 1)]) {
        dp1[i][i + j - 1] = min(dp1[i][i + j - 1], dp1[i + 1][i + j - 2]);
      } else {
        dp1[i][i + j - 1] = min(dp1[i][i + j - 1], 1 + dp1[i + 1][i + j - 2]);
      }
    }
  }
  memset(dp2, -1, sizeof(dp2));
  cout << getans(1, 0) << endl;
  trace(1, 0);
  for (int i = 0; i < ans.size(); i++) {
    if (i < ans.size() - 1)
      cout << ans[i] << "+";
    else
      cout << ans[i];
  }
}
int main() {
  int t = 1;
  for (int i = 1; i <= t; i++) {
    solve();
  }
  return 0;
}
