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, ['f', 'r', 'Z', '1989', '5035', '1623', '9335', '7495', '8663', '2199', '2047', 'o']

Ex Output:
36339


Ex Input:
13, 14, ['5297', 'V', '7495', '6967', 'b', 'w', 'a', '2403', 'V', 'n', '525', 'd', 'o', 'm', '3439', '4245', '6381', '5743', 'P', '1047']

Ex Output:
0


Ex Input:
10, 19, ['5599', 'F', '9413', '1467', '2011', '8931', 'G', '2779', 'h', '5437', 'C', 'U', '2271', '8247', 'Y', '6697', 'X', '1661', 'C', 'g', '4789', '8819']

Ex Output:

24313