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]: 5, 10, ['8553', '4157', 'm', 'Q', 'u', 'j', 'X', 'r', '8579', '255', 'A', 'g', '7017', '5707', 'd', 'O', 'V', 's', 'p', '337', 'F', '5439', '5715', 'c', '2615', 'l', '3537']
[EX A]: 8834

[EX Q]: 1, 6, ['B', 'N', 'b', '9383', '4711', 'K']
[EX A]: 14094

[EX Q]: 1, 7, ['2003', 's', 'D', 'm', '5507', 'z', 'z', '3023', '5097', 'i', 'T', '8663', 'z', '7755', 'j', '8959']
[EX A]:
7510