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:
1, 11, ['W', 'c', '8889', '2649', '6183', '1489', 't', 'o', '4925', '4411', 'b', '5657', 'i', 'q', 'z', 't']

Ex Output:
28546


Ex Input:
3, 13, ['9585', '4573', '8113', '4163', 'D', '4641', '2077', 'D', '5339', 'Y', 'Z', '9133', '9401', 'o', '5033', 'd', '1745', '1357', '5513', '5369', 'N', '9355', 'C', 'W', 'C']

Ex Output:
42867


Ex Input:
4, 6, ['p', '3847', 'N', '57', 'x', '7381', '8863', 'H']

Ex Output:

7438