#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5, inf = 1e9;
int dp[N][N][2];
int nxcw[N], f[N], nxacw[N], ary[N], nx2cw[N], nx2acw[N], nxt[N];
int n, s, mx = 0;
map<int, int> M;
int dist(int a, int b) {
  if (a > b) swap(a, b);
  int ret = n - b + a;
  return min(b - a, ret);
}
pair<char, int> dist1(int a, int b) {
  pair<char, int> ans;
  int f = 0;
  if (a > b) {
    f = 1;
    swap(a, b);
  }
  int ret = n - b + a;
  if (b - a < ret) {
    ans.first = '+';
    ans.second = b - a;
  } else {
    ans.first = '-';
    ans.second = ret;
  }
  if (f == 1) {
    if (ans.first == '+')
      ans.first = '-';
    else
      ans.first = '+';
  }
  return ans;
}
int cnt = 0;
int solve(int cur, int opp, int dir) {
  if (dp[cur][opp][dir] == -1) {
    int x = inf;
    if (dir == 0) {
      int lf = nxacw[opp];
      int rt = nxcw[cur];
      if (lf == cur) {
        if (ary[cur] == mx)
          x = 0;
        else {
          lf = nx2acw[cur];
          rt = nx2cw[cur];
          x = min(x, dist(cur, lf) + solve(lf, lf, 0));
          x = min(x, dist(cur, rt) + solve(rt, rt, 0));
        }
      } else {
        x = min(x, dist(cur, rt) + solve(rt, opp, 0));
        x = min(x, dist(cur, lf) + solve(lf, cur, 1));
      }
    } else {
      int lf = nxacw[cur];
      int rt = nxcw[opp];
      if (rt == cur) {
        if (ary[cur] == mx)
          x = 0;
        else {
          lf = nx2acw[cur];
          rt = nx2cw[cur];
          x = min(x, dist(cur, lf) + solve(lf, lf, 0));
          x = min(x, dist(cur, rt) + solve(rt, rt, 0));
        }
      } else {
        x = min(x, dist(cur, rt) + solve(rt, cur, 0));
        x = min(x, dist(cur, lf) + solve(lf, opp, 1));
      }
    }
    dp[cur][opp][dir] = x;
  }
  return dp[cur][opp][dir];
}
pair<pair<int, int>, int> find2(int cur, int opp, int dir, int val) {
  if (dir == 0) {
    int lf = nxacw[opp];
    int rt = nxcw[cur];
    if (lf == cur) {
      lf = nx2acw[cur];
      rt = nx2cw[cur];
      if (dist(cur, lf) + solve(lf, lf, 0) == val) {
        return make_pair(make_pair(lf, lf), (int)0);
      }
      if (dist(cur, rt) + solve(rt, rt, 0) == val) {
        return make_pair(make_pair(rt, rt), (int)0);
      }
    } else {
      if (dist(cur, rt) + solve(rt, opp, 0) == val) {
        return make_pair(make_pair(rt, opp), (int)0);
      }
      if (dist(cur, lf) + solve(lf, cur, 1) == val) {
        return make_pair(make_pair(lf, cur), (int)1);
      }
    }
  } else {
    int lf = nxacw[cur];
    int rt = nxcw[opp];
    if (rt == cur) {
      lf = nx2acw[cur];
      rt = nx2cw[cur];
      if (dist(cur, lf) + solve(lf, lf, 0) == val) {
        return make_pair(make_pair(lf, lf), 0);
      }
      if (dist(cur, rt) + solve(rt, rt, 0) == val) {
        return make_pair(make_pair(rt, rt), (int)0);
      }
    } else {
      if (dist(cur, rt) + solve(rt, cur, 0) == val) {
        return make_pair(make_pair(rt, cur), (int)0);
      }
      if (dist(cur, lf) + solve(lf, opp, 1) == val) {
        return make_pair(make_pair(lf, opp), (int)1);
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> s;
  s--;
  vector<int> v;
  for (int i = 0; i < n; ++i) {
    cin >> ary[i];
    v.push_back(ary[i]);
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < n; ++i) {
    if (M.count(v[i]) == 0) {
      M[v[i]] = mx++;
    }
    v[i] = M[v[i]];
  }
  mx--;
  for (int i = 0; i < n; ++i) {
    ary[i] = M[ary[i]];
    f[ary[i]]++;
  }
  for (int i = 0; i < n; ++i) {
    int cur = i + 1;
    if (cur == n) cur = 0;
    while (1) {
      if (ary[i] == ary[cur]) {
        nxcw[i] = cur;
        break;
      }
      cur++;
      if (cur == n) cur = 0;
    }
    cur = i - 1;
    if (cur == -1) cur = n - 1;
    while (1) {
      if (ary[i] == ary[cur]) {
        nxacw[i] = cur;
        break;
      }
      cur--;
      if (cur == -1) cur = n - 1;
    }
    if (ary[i] != mx) {
      cur = i + 1;
      if (cur == n) cur = 0;
      while (1) {
        if (ary[i] + 1 == ary[cur]) {
          nx2cw[i] = cur;
          break;
        }
        cur++;
        if (cur == n) cur = 0;
      }
      cur = i - 1;
      if (cur == -1) cur = n - 1;
      while (1) {
        if (ary[i] + 1 == ary[cur]) {
          nx2acw[i] = cur;
          break;
        }
        cur--;
        if (cur == -1) cur = n - 1;
      }
    }
  }
  memset(dp, -1, sizeof(dp));
  int ans = inf, id = -1;
  for (int i = 0; i < n; ++i) {
    if (ary[i] == 0) {
      int x = dist(s, i) + solve(i, i, 0);
      if (x < ans) {
        ans = x;
        id = i;
      }
    }
  }
  cout << ans << "\n";
  int rem = ans;
  pair<char, int> x = dist1(s, id);
  cout << x.first << x.second << "\n";
  int cur = id;
  int opp = id;
  int dir = 0;
  rem -= x.second;
  for (int i = 1; i < n; ++i) {
    auto it = find2(cur, opp, dir, rem);
    pair<char, int> x = dist1(cur, it.first.first);
    cout << x.first << x.second << "\n";
    cur = it.first.first;
    opp = it.first.second;
    dir = it.second;
    rem -= x.second;
  }
  return 0;
}
