Problem: Everyone who has played Cut the Rope knows full well how the gameplay is organized. All levels in the game are divided into boxes. Initially only one box with some levels is available. Player should complete levels to earn stars, collecting stars opens new box with levels.

<image>

Imagine that you are playing Cut the Rope for the first time. Currently you have only the levels of the first box (by the way, it is called "Cardboard Box"). Each level is characterized by two integers: ai — how long it takes to complete the level for one star, bi — how long it takes to complete the level for two stars (ai < bi).

You want to open the next box as quickly as possible. So, you need to earn at least w stars. How do make it happen? Note that the level can be passed only once: either for one star or for two. You do not necessarily need to pass all the levels.

Input

The first line contains two integers n and w (1 ≤ n ≤ 3·105; 1 ≤ w ≤ 2n) — the number of levels in the first box and the number of stars you need to open another box. Each of the following n lines contains two integers ai and bi (1 ≤ ai < bi ≤ 109) — the attributes of the i-th level.

Output

In the first line print integer t — the minimum time you need to open the next box. 

In the next line, print n digits without spaces — the description of the optimal scenario: 

  * if you need to pass the i-th level for one star, the i-th digit should equal 1; 
  * if you need to pass the i-th level for two stars, the i-th digit should equal 2; 
  * if you do not need to pass the i-th level at all, the i-th digit should equal 0. 

Examples

Input

2 3
1 2
1 2


Output

3
12


Input

5 3
10 20
5 10
10 20
6 9
25 30


Output

14
01020

Note

In the first test sample, answer 21 is also assumed correct.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 7;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-9;
const double PI = acos(-1);
const int MAX = 4000007;
struct Node {
  Node() {
    ls = rs = NULL;
    sum = cnt = 0;
  }
  Node *ls, *rs;
  long long sum;
  int cnt;
} pool[MAX], nil, *null, *Rt;
Node* stk[MAX];
int tot;
inline Node* newNode() {
  Node* pt = stk[--tot];
  pt->cnt = pt->sum = 0;
  pt->ls = pt->rs = null;
  return pt;
}
void sgtinit() {
  Node* pt = &pool[0];
  for (int i = 1; i < MAX; i++) stk[tot++] = &pool[i];
  null = &nil;
  null->ls = null->rs = null;
  null->cnt = null->sum = 0;
  Rt = newNode();
}
inline void pull(Node* rt) {
  rt->cnt = rt->ls->cnt + rt->rs->cnt;
  rt->sum = rt->ls->sum + rt->rs->sum;
  if (!rt->ls->cnt) stk[tot++] = rt->ls, rt->ls = null;
  if (!rt->rs->cnt) stk[tot++] = rt->rs, rt->rs = null;
}
inline void push(Node* rt) {
  if (rt->ls == null) rt->ls = newNode();
  if (rt->rs == null) rt->rs = newNode();
}
void update(int p, int c, int l, int r, Node* rt) {
  if (l == r) {
    rt->cnt += c;
    rt->sum += 1LL * p * c;
    return;
  }
  push(rt);
  int mid = l + r >> 1;
  if (p <= mid)
    update(p, c, l, mid, rt->ls);
  else
    update(p, c, mid + 1, r, rt->rs);
  pull(rt);
}
long long query(int k, int l, int r, Node* rt) {
  if (!k) return 0;
  if (rt->cnt <= k) return rt->sum;
  if (l == r) return 1LL * k * l;
  int mid = l + r >> 1;
  if (rt->ls->cnt >= k)
    return query(k, l, mid, rt->ls);
  else
    return query(rt->ls->cnt, l, mid, rt->ls) +
           query(k - rt->ls->cnt, mid + 1, r, rt->rs);
}
int n, w, a[N], b[N], id[N], fin[N];
long long ans = INF;
bool cmpa(int x, int y) { return a[x] < a[y]; }
bool cmpb(int x, int y) { return b[x] < b[y]; }
int main() {
  sgtinit();
  scanf("%d%d", &n, &w);
  for (int i = 1; i <= n; i++) scanf("%d%d", &a[i], &b[i]);
  for (int i = 1; i <= n; i++) id[i] = i;
  int where = -1;
  sort(id + 1, id + 1 + n, cmpa);
  if (w <= n) {
    long long ret = 0;
    for (int i = 1; i <= w; i++) ret += a[id[i]];
    ans = min(ans, ret);
    where = 0;
  }
  sort(id + 1, id + 1 + n, cmpb);
  for (int i = 1; i <= n; i++) update(a[id[i]], 1, 1, inf, Rt);
  long long prefix = 0;
  long long ret = 0;
  for (int i = 1; i <= n; i++) {
    int x = id[i];
    update(a[x], -1, 1, inf, Rt);
    ret = prefix + b[x];
    int need = w - (i + 1);
    if (Rt->cnt >= need) {
      ret += query(need, 1, inf, Rt);
      if (ret < ans) {
        ans = ret;
        where = i;
      }
    }
    prefix += a[x];
    update(b[x] - a[x], 1, 1, inf, Rt);
  }
  if (!where) {
    sort(id + 1, id + 1 + n, cmpa);
    for (int i = 1; i <= w; i++) fin[id[i]] = 1;
  } else {
    priority_queue<pair<int, int>, vector<pair<int, int> >,
                   greater<pair<int, int> > >
        que;
    fin[id[where]] = 2;
    w -= where + 1;
    for (int i = 1; i < where; i++)
      que.push(make_pair(b[id[i]] - a[id[i]], i)), fin[id[i]] = 1;
    for (int i = where + 1; i <= n; i++) que.push(make_pair(a[id[i]], i));
    while (w--) {
      int who = que.top().second;
      que.pop();
      if (who < where)
        fin[id[who]] = 2;
      else
        fin[id[who]] = 1;
    }
  }
  printf("%lld\n", ans);
  for (int i = 1; i <= n; i++) printf("%d", fin[i]);
  puts("");
  return 0;
}