s = gets
K = gets.to_i
N = s.to_s.length

dp = Array.new(105) {Array.new(4) {Array.new(2, 0)}} #動的計画法

dp[0][0][0] = 1

(0...N).each do |i|                            #それぞれの桁の数について 
    (0..K).each do |j|
        (0..1).each do |k|
            nd = s[i].to_i
            (0..9).each do |d|
                ni = i + 1
                nj = d == 0 ? j : j + 1        # 0以外の数字が出てきた回数
                nk = k == 0 && nd == d ? 0 : 1
                
                next if nj > K
                next if k == 0 && nd < d
                next if dp[i][j][k] == 0

                dp[ni][nj][nk] += dp[i][j][k]
            end
        end
    end
end

puts dp[N][K][0] + dp[N][K][1] 




puts ans