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 Q]: 7, 9, ['6409', '7805', '2757', 'A', '8949', '449', 'N', 'M', '9511', 'v', '6085', '1101', '4995', 'B', '6039', '295', '5459', '4211', 't', '3415']
[EX A]: 9511

[EX Q]: 1, 10, ['H', 'P', '1985', '1797', '9115', 'V', 'o', '2405', '7817', 't', 'C']
[EX A]: 23119

[EX Q]: 9, 10, ['F', '8373', '3799', 'C', '2939', '8247', '1143', 'X', '3835', 'Z', '9755', '1491', '3257', 'S', '4523', '2401', 'J', 'T', 'R', '9901', '2317', 'E', '117', '2443', '4789']
[EX A]:
3835