Finding the number of integers between 1 and K, who's sum of the digits is a multiple of D
There's probably a more efficient method, but I can't think of one at the moment. A few suggestions, though:


Why do you have a badly-named variable hello that is only used once? I'd recommend inlining it.
There's no need for parentheses around the condition for the if statement.
There's no need to convert the map to a list before finding the sum.
You could convert the loop into the sum of a generator expression.
It's probably a good idea to convert your code to have a main function and an if __name__ == '__main__' guard.


Result (not tested):

def perform_calculation(k, d):
    return sum(sum(map(int, str(i))) % d == 0 for i in range(1, k+1))

def main():
    k = int(input())
    d = int(input())

    print(perform_calculation(k, d))

if __name__ == '__main__':
    main()