# DRUNKWATER TEMPLATE(add description and prototypes)
# Question Title and Description on leetcode.com
# Function Declaration and Function Prototypes on leetcode.com
#440. K-th Smallest in Lexicographical Order
#Given integers n and k, find the lexicographically k-th smallest integer in the range from 1 to n.
#Note: 1 ≤ k ≤ n ≤ 109.
#Example:
#Input:
#n: 13   k: 2
#Output:
#10
#Explanation:
#The lexicographical order is [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9], so the second smallest number is 10.
#class Solution:
#    def findKthNumber(self, n, k):
#        """
#        :type n: int
#        :type k: int
#        :rtype: int
#        """



# Time Is Money
# DRUNKWATER TEMPLATE(add description and prototypes)
# Question Title and Description on leetcode.com
# Function Declaration and Function Prototypes on leetcode.com
#440. K-th Smallest in Lexicographical Order
#Given integers n and k, find the lexicographically k-th smallest integer in the range from 1 to n.
#Note: 1 ≤ k ≤ n ≤ 109.
#Example:
#Input:
#n: 13   k: 2
#Output:
#10
#Explanation:
#The lexicographical order is [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9], so the second smallest number is 10.
#class Solution:
#    def findKthNumber(self, n, k):
#        """
#        :type n: int
#        :type k: int
#        :rtype: int
#        """



# Time Is Money
# DRUNKWATER TEMPLATE(add description and prototypes) # Question Title and Description on leetcode.com # Function Declaration and Function Prototypes on leetcode.com #440. K-th Smallest in Lexicographical Order #Given integers n and k, find the lexicographically k-th smallest integer in the range from 1 to n. #Note: 1 ≤ k ≤ n ≤ 109. #Example: #Input: #n: 13   k: 2 #Output: #10 #Explanation: #The lexicographical order is [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9], so the second smallest number is 10. #class Solution: #    def findKthNumber(self, n, k): #        """ #        :type n: int #        :type k: int #        :rtype: int #        """ # Time Is Money