def obtainCount(n, k):
    champ = ""
    total = 0
    for i in range(1, n + 1):
        champ += f'{i}'
        numLen = len(champ)

        # For the current number, check if it's
        # divisible by k.
        remainder = 0
        for j in range(numLen):
            remainder = (remainder*10 + int(champ[j])) % k

        if remainder == 0:
            total += 1

    return total