#include <bits/stdc++.h>
using namespace std;
long long modulo(long long base, long long exponent, long long modulus);
long long choose(long long n, long long k);
long long inverse(long long a, long long m);
void build();
void fileio();
long long ncr(long long n, long long r);
const int nax = 1e6 + 10;
const int LG = log2(nax) + 1;
vector<long long> fact(nax);
long long cost[505][505];
long long dp[505][505];
string s;
void getans(long long n, long long k, string &ans) {
  if (n == 0 || k == 0) return;
  for (int i = 1; i <= n; i++) {
    if (dp[i - 1][k - 1] + cost[i - 1][n - 1] == dp[n][k]) {
      getans(i - 1, k - 1, ans);
      string temp;
      long long l = i - 1, r = n - 1;
      while (l <= r) {
        temp += s[l];
        l++;
        r--;
      }
      for (int j = temp.size() - 1 - (n - i + 1) % 2; j >= 0; j--) {
        temp += temp[j];
      }
      ans += temp;
      if (n != s.size()) ans += '+';
      return;
    }
  }
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> s;
  long long k;
  cin >> k;
  long long n = s.size();
  for (int i = 0; i < n; i++) {
    for (int j = i; j < n; j++) {
      long long temp = 0;
      long long l = i, r = j;
      while (l <= r) {
        if (s[l] != s[r]) temp++;
        l++;
        r--;
      }
      cost[i][j] = temp;
    }
  }
  for (int i = 0; i < 505; i++)
    for (int j = 0; j < 505; j++) dp[i][j] = 1000000000000000;
  dp[0][0] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= k; j++) {
      for (int l = i; l > 0; l--) {
        dp[i][j] = min(dp[i][j], dp[l - 1][j - 1] + cost[l - 1][i - 1]);
      }
    }
  }
  long long ans = 1000000000000000;
  long long kk = 1;
  for (int i = 1; i <= k; i++) {
    if (ans > dp[n][i]) {
      ans = dp[n][i];
      kk = i;
    }
  }
  string ans1;
  getans(n, kk, ans1);
  cout << ans << '\n';
  cout << ans1 << '\n';
  return 0;
}
long long ncr(long long n, long long r) {
  if (r > n || r < 0 || n < 0) return 0;
  long long ans = fact[n];
  long long temp = (fact[n - r] * fact[r]) % 1000000007;
  ans = (ans * inverse(temp, 1000000007)) % 1000000007;
  return ans;
}
void fileio() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
void build() {
  fact[0] = 1;
  for (long long i = 1; i < nax; i++) fact[i] = (fact[i - 1] * i) % 1000000007;
}
long long modulo(long long base, long long exponent, long long modulus) {
  if (modulus == 1) return 0;
  long long result = 1;
  base = base % modulus;
  while (exponent > 0) {
    if (exponent % 2 == 1) {
      result = (result * base) % modulus;
    }
    exponent = exponent >> 1;
    base = (base * base) % modulus;
  }
  return result;
}
long long choose(long long n, long long k) {
  if (k == 0) return 1;
  return (n * choose(n - 1, k - 1)) / k;
}
void EE(long long a, long long b, long long &co1, long long &co2) {
  if (a % b == 0) {
    co1 = 0;
    co2 = 1;
    return;
  }
  EE(b, a % b, co1, co2);
  long long temp = co1;
  co1 = co2;
  co2 = temp - co2 * (a / b);
}
long long inverse(long long a, long long m) {
  long long x, y;
  EE(a, m, x, y);
  if (x < 0) x += m;
  return x;
}
