------
## 最终结论
```python
def find_kth_number(n, k):
    current = 1
    k -= 1  # Since we start counting from 1, we subtract 1 from k

    while k > 0:
        count = 0
        first = current
        last = current + 1
        
        while first <= n:
            count += min(n + 1, last) - first
            first *= 10
            last *= 10
        
        if count <= k:
            k -= count
            current += 1
        else:
            current *= 10
            k -= 1
    
    return current

# Example usage:
n = 13
k = 2
print(find_kth_number(n, k))  # Output: 10
```