output_description: Print the count.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      K
attempt: n = int(input())
  l = len(str(n))
  k = int(input())
  dp = [[[0] * (k + 1) for _ in range(2)] for _ in range(l + 1)]
  dp[0][1][0] = 1
  for pos in range(l):
      num = int(str(n)[pos])
      for i in range(10):
          if i == 0:
              for count in range(k + 1):
                  dp[pos + 1][0][count] += dp[pos][0][count] + dp[pos][1][count]
          elif i < num:
              for count in range(k):
                  dp[pos + 1][0][count + 1] += dp[pos][0][count] + dp[pos][1][count]
          elif i == num:
              for count in range(k):
                  dp[pos + 1][1][count + 1] += dp[pos][1][count]
                  dp[pos + 1][0][count + 1] += dp[pos][0][count]
          else:
              for count in range(k):
                  dp[pos + 1][0][count + 1] += dp[pos][0][count]
  print(dp[l][0][k] + dp[l][1][k])
  
problem_description: Statement
  
  Find the number of integers between 1 and N (inclusive) that contains exactly
  K non-zero digits when written in base ten.
samples: [{"input": "100\n    1", "output": "19\n    \n\nThe following 19 integers satisfy the condition:\n\n  * 1,2,3,4,5,6,7,8,9,10,20,30,40,50,60,70,80,90,100\n\n* * *"}, {"input": "25\n    2", "output": "14\n    \n\nThe following 14 integers satisfy the condition:\n\n  * 11,12,13,14,15,16,17,18,19,21,22,23,24,25\n\n* * *"}, {"input": "314159\n    2", "output": "937\n    \n\n* * *"}, {"input": "9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999\n    3", "output": "117879300"}]