#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;

const long long MAX_N = 200;
const long long MAX_I = 100001;
const long long INF = 1LL << 60;

int main() {
    long long N, K;
    cin >> N >> K;

    if (N >= 200) {
        cout << K << endl;
        return 0;
    }

    K++;
    vector<vector<unsigned long long>> dp(MAX_I, vector<unsigned long long>(N + 10, 0));
    dp[0][0] = 1;

    // DPテーブルの更新
    for (long long i = 0; i < MAX_I - 1; i++) {
        for (long long j = 0; j <= N; j++) {
            dp[i][j] = min(dp[i][j], static_cast<unsigned long long>(K + 1));
            for (long long k = 0; k < 10; k++) {
                if (j + k <= N) {
                    dp[i + 1][j + k] += dp[i][j];
                }
            }
        }
    }

    vector<string> ans;
    long long cnt = 0;
    long long sm = 0;

    // 答えを作成
    for (long long i = MAX_I - 1; i >= 0; i--) {
        for (long long j = 0; j < N; j++) {
            dp[i][j + 1] += dp[i][j];
            dp[i][j + 1] = min(dp[i][j + 1], static_cast<unsigned long long>(K + 1));
        }
        for (long long j = 0; j < min(10LL, N - sm + 1); j++) {
            if (K <= cnt + dp[i][N - sm - j]) {
                if (!ans.empty() || j != 0) {
                    ans.push_back(to_string(j));
                }
                sm += j;
                break;
            } else {
                cnt += dp[i][N - sm - j];
            }
        }
    }

    // 答えの出力
    for (const auto& str : ans) {
        cout << str;
    }
    cout << endl;

    return 0;
}