#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define SPEED ios_base::sync_with_stdio(false); cin.tie(NULL);
#define FOR(i, a, b) for (ll i = a; i < b; ++i)
#define RFOR(i, b, a) for (ll i = b; i >= a; --i)
#define ALL(x) x.begin(), x.end()
#define DEBUG(args...) { string _s = #args; replace(ALL(_s), ' ', '\0');\
replace(ALL(_s), ',', ' ');\
stringstream _ss(_s); istream_iterator<string> _it(_ss); _debug(_it, args);}
#define endl "\n"
#define F first
#define S second
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)

using namespace std;
using namespace __gnu_pbds;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

void _debug(istream_iterator<string>) {}
template<typename T, typename... Args>
void _debug(istream_iterator<string> it, T first, Args... args) {
    cerr << ">> " << *it << " : " << first << endl; _debug(++it, args...);
}
template <typename T1, typename T2>
inline ostream& operator << (ostream& out, const pair<T1, T2>& p) {
    return out << "(" << p.F << ", " << p.S << ")";
}
template<typename T>
inline ostream& operator << (ostream& out, const vector<T>& v) {
    if (v.empty()) return out << "[]";
    else { out << '['; for (auto& e : v) { out << e << ", "; } return out << "\b\b]"; }
}
template<typename T>
inline ostream& operator << (ostream& out, const set<T>& s) {
    if (s.empty()) return out << "{}";
    else { out << '{'; for (auto& e : s) { out << e << ", "; } return out << "\b\b}"; }
}
template<typename T>
inline ostream& operator << (ostream& out, const unordered_set<T>& s) {
    return out << set<T>(ALL(s));
}
template<typename T1, typename T2>
inline ostream& operator << (ostream& out, const map<T1, T2>& m) {
    if (m.empty()) return out << "{}";
    out << '{'; for (auto& p : m) { out << p << ", "; } return out << "\b\b}";
}
template<typename T1, typename T2>
inline ostream& operator << (ostream& out, const unordered_map<T1, T2>& m) {
    return out << map<T1, T2>(ALL(m));
}
template<typename T>
inline ostream& operator << (ostream& out, const ordered_set<T>& s) {
    return out << set<T>(ALL(s));
}

typedef long long ll;
typedef long double ld;
typedef vector<long long> vll;
typedef pair<ll, ll> pll;
typedef vector<pair<ll, ll>> vpll;
typedef unordered_map<ll, ll> STll;
/************************************** MAIN PROGRAM ********************************************/
ll ans = 0;
string n;
//
//void brute(string x, int cur) {
//
//    if (x.size() > n.size()) {
//        return;
//    } else if (x.size() == n.size()) {
//
//        if (cur == 3 && x <= n) {
//            ans++;
//        } else {
//            return;
//        }
//    }
//    if (cur > 3) return;
//    brute(x + '0', cur);
//    FOR(dig, 1, 10) {
//        brute(x + (char)(dig + '0'), cur + 1);
//    }
//}

int main()
{
    //freopen("input.txt", "r", stdin);
    SPEED
    int k;
    cin >> n >> k;
    //brute("", 0);

    while (n[0] == '0') {
        string res = "";
        FOR(i, 1, n.size()) {
            res += n[i];
        };
        swap(n, res);
    }


    if (k == 1) {
        FOR(i, 0, n.size()) {
            string brute(n.size(), '0');
            FOR(dig, 1, 10) {
                brute[i] = dig + '0';
                ans += brute <= n;
            }
        }
        cout << ans;
        return 0;
    } else if (k == 2) {
        FOR(i, 0, n.size()) {
            FOR(j, i + 1, n.size()) {
                FOR(digi, 1, 10) {
                    FOR(digj, 1, 10) {
                        string brute(n.size(), '0');
                        brute[i] = digi + '0';
                        brute[j] = digj + '0';
                        ans += brute <= n;
                    }
                }
            }
        }
        cout << ans;
        return 0;
    }

    FOR(i, 0, n.size()) {
        FOR(j, i + 1, n.size()) {
            FOR(k, j + 1, n.size()) {
                if (i == 0 && n[i] != 0) {
                    ans += (n[i] - '0' - 1) * 9 * 9;
                } else {
                    ans += 9 * 9 * 9;
                }
            }
        }
    }
    FOR(j, 1, n.size()) {
        FOR(k, j + 1, n.size()) {
            FOR(digj, 1, 10) {
                FOR(digk, 1, 10) {
                    string brute(n.size(), '0');
                    brute[0] = n[0];
                    brute[j] = digj + '0';
                    brute[k] = digk + '0';
                    ans += brute <= n;
                }
            }
        }
    }
    cout << ans;
}
/************************************** END OF PROGRAM ******************************************/
/** Stuff you should look for:
 * int overflow, array bounds, over-counting, graph is not a tree/connected
 * special cases (n=1?), set/unordered_set TLE, multi-set/set error
 * do something instead of nothing and stay organized
 */


Measured memory_bytes: 256