In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.

Ex Input:
2, 10, ['2797', 'm', '439', '5677', '6719', '1587', 'I', 'I', 'w', '8483', '7341', '341', 'H', 'K', '7727', '4467', 'L']

Ex Output:
22905


Ex Input:
2, 2, ['8023', '9385', '7533', 'd', 'H', '3751', 'A', '1399']

Ex Output:
9385


Ex Input:
4, 22, ['6455', 'g', '4451', '1119', '7317', '7883', '295', 'w', 'z', 'q', 'k', 'L', '9619', 'A', '1465', '8627', 'R', 'f', '8925', '4939', 'c', '8949', '8667', '9081', '5373', 'd']

Ex Output:

59138