#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define double long double
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x)                                                              \
    for(auto &youso_ : (x)) cin >> youso_
#define bitcnt(x) __builtin_popcount(x)
#define lbit(x) __builtin_ffsll(x)
#define rbit(x) __builtin_clzll(x)
#define SZ(x) ((ll)(x).size())
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()

template <typename T = long long> inline T IN() {
    T x;
    cin >> x;
    return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
    cin >> head;
    CIN(move(tail)...);
}
#define CCIN(...)                                                              \
    char __VA_ARGS__;                                                          \
    CIN(__VA_ARGS__)
#define DCIN(...)                                                              \
    double __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define LCIN(...)                                                              \
    ll __VA_ARGS__;                                                            \
    CIN(__VA_ARGS__)
#define SCIN(...)                                                              \
    string __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
#define Printv(v)                                                              \
    {                                                                          \
        FOREACH(x, v) { cout << x << " "; }                                    \
        cout << "\n";                                                          \
    }
template <typename T = string> inline void eputs(T s) {
    cout << s << "\n";
    exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
    std::fill((T *)array, (T *)(array + N), val);
}

template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;

typedef long long ll;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;

const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 1e18;
// const double PI = atan(1.0) * 4.0;
const ll dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.1415

template <typename T, typename E> struct SegmentTree {
    using F = function<T(T, T)>;
    using G = function<T(T, E)>;
    using H = function<E(E, E)>;
    using P = function<E(E, int)>;
    int n;
    // dat(蜃ｺ蜉�)縺ｮ繝槭�ｼ繧ｸ�ｼ域峩譁ｰ�ｼ�
    F f;
    // laz繧壇at縺ｫ蜿肴丐貍皮ｮ�
    G g;
    // laz(譖ｴ譁ｰ)縺ｮ繝代�ｼ繧ｸ�ｼ域峩譁ｰ�ｼ会ｼ井ｸ九↓莨晄眺�ｼ�
    H h;
    // laz繧壇at縺ｫ蜿肴丐貍皮ｮ�(縺ｾ縺ｨ繧�)
    P p;
    T e1;
    E e2;
    vector<T> dat;
    vector<E> laz;
    SegmentTree(int n_, F f, G g, H h, T e1, E e2, vector<T> v = vector<T>(),
                P p = [](E a, int b) { return a; })
        : f(f), g(g), h(h), e1(e1), e2(e2), p(p) {
        init(n_);
        if(n_ == (int)v.size()) build(n_, v);
    }
    void init(int n_) {
        n = 1;
        while(n < n_) n *= 2;
        dat.clear();
        dat.resize(2 * n - 1, e1);
        laz.clear();
        laz.resize(2 * n - 1, e2);
    }
    void build(int n_, vector<T> v) {
        for(int i = 0; i < n_; i++) dat[i + n - 1] = v[i];
        for(int i = n - 2; i >= 0; i--)
            dat[i] = f(dat[i * 2 + 1], dat[i * 2 + 2]);
    }
    inline void eval(int len, int k) {
        if(laz[k] == e2) return;
        if(k * 2 + 1 < n * 2 - 1) {
            laz[k * 2 + 1] = h(laz[k * 2 + 1], laz[k]);
            laz[k * 2 + 2] = h(laz[k * 2 + 2], laz[k]);
        }
        dat[k] = g(dat[k], p(laz[k], len));
        laz[k] = e2;
    }
    T update(int a, int b, E x, int k, int l, int r) {
        eval(r - l, k);
        if(r <= a || b <= l) return dat[k];
        if(a <= l && r <= b) {
            laz[k] = h(laz[k], x);
            return g(dat[k], p(laz[k], r - l));
        }
        eval(r - l, k);
        return dat[k] = f(update(a, b, x, k * 2 + 1, l, (l + r) / 2),
                          update(a, b, x, k * 2 + 2, (l + r) / 2, r));
    }
    T update(int a, int b, E x) { return update(a, b, x, 0, 0, n); }
    T query(int a, int b, int k, int l, int r) {
        eval(r - l, k);
        if(r <= a || b <= l) return e1;
        if(a <= l && r <= b) return dat[k];
        T vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
        T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
        return f(vl, vr);
    }
    T query(int a, int b) { return query(a, b, 0, 0, n); }
};

// 0-indexed
template <class T> struct BinaryIndexedTree {
    vector<T> data;

    BinaryIndexedTree(int sz) { data.assign(++sz, 0); }

    T sum(int k) {
        T ret = 0;
        for(++k; k > 0; k -= k & -k) ret += data[k];
        return (ret);
    }

    void add(int k, T x) {
        for(++k; k < data.size(); k += k & -k) data[k] += x;
    }
};

template <class T> struct AdditionalBIT : BinaryIndexedTree<T> {
    int curr;

    AdditionalBIT(int sz) : BinaryIndexedTree<T>(sz) {
        curr = 1;
        while(curr <= sz) curr <<= 1;
    }

    int lower_bound(T w) {
        if(w <= 0) return (0);
        int i = 0;
        for(int k = curr; k > 0; k >>= 1) {
            if(i + k < BinaryIndexedTree<T>::data.size() &&
               BinaryIndexedTree<T>::data[i + k] < w) {
                w -= BinaryIndexedTree<T>::data[i + k];
                i += k;
            }
        }
        return (i);
    }
};

signed main() {
    SCIN(S);
    ll N = S.length();
    VL a(N);
    REP(i, N) a[i] = S[i] - 'a';
    LCIN(k);
    auto f = [](ll a, ll b) { return min(a, b); };
    auto g = [](ll a, ll b) { return b != -1 ? b : a; };
    auto h = [](ll a, ll b) { return b != -1 ? b : a; };
    ll e1 = LINF, e2 = -1;
    SegmentTree<ll, ll> seg(N, f, g, h, e1, e2, a);
    AdditionalBIT<ll> num(N + 3);
    set<ll> memo[26];
    REP(i, N) memo[a[i]].emplace(i);
    string ans = "";
    REP(i, N) num.add(i, 1);
    while(k >= 1) {
        ll midx = num.lower_bound(k + 1);
        ll val = seg.query(0, midx + 1);
        if(val == e1) break;
        ll idx = *memo[val].begin();

        seg.update(idx, idx + 1, LINF);
        memo[val].erase(idx);

        num.add(idx, -1);
        k -= num.sum(idx);

        ans += 'a' + val;
    }
    REP(i, N) {
        ll val = seg.query(i, i + 1);
        if(val != LINF) ans += 'a' + val;
    }
    cout << ans << "\n";
}



Measured memory_bytes: 24004