#include <bits/stdc++.h>
using namespace std;
const long long int M = 500 + 5;
const long long int inf = 1e9;
long long int n, k;
long long int lr[M][M], dp[M][M], par[M][M];
bool check[M];
string s;
void rec(long long int l, long long int r) {
  if (r - l <= 1) return;
  s[r - 1] = s[l];
  rec(l + 1, r - 1);
}
int main() {
  ios::sync_with_stdio(0);
  cin >> s >> k;
  n = (long long int)s.size();
  for (long long int i = 0; i < n + 1; i++)
    for (long long int j = i; j >= 0; j--)
      if (i - j > 1) lr[j][i] = (s[j] != s[i - 1]) + lr[j + 1][i - 1];
  for (long long int i = 1; i < n + 1; i++) {
    dp[i][0] = lr[0][i];
    for (long long int j = 1; j < k; j++) {
      dp[i][j] = inf;
    }
    for (long long int j = 1; j < k; j++) {
      for (long long int k1 = 0; k1 < i; k1++) {
        if (dp[i][j] > dp[k1][j - 1] + lr[k1][i]) {
          par[i][j] = k1;
          dp[i][j] = dp[k1][j - 1] + lr[k1][i];
        }
      }
    }
  }
  long long int x = n;
  for (long long int i = k - 1; i >= 0; i--) {
    check[x] = 1;
    rec(par[x][i], x);
    x = par[x][i];
  }
  check[0] = 0;
  cout << dp[n][k - 1] << '\n';
  for (int i = 0; i < n; i++) {
    if (check[i]) cout << '+';
    cout << s[i];
  }
  cout << endl;
}
