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]: 2, 3, ['E', '7611', '2621', '3237']
[EX A]: 10232

[EX Q]: 2, 4, ['3155', '581', 'N', '153', 't', '7941', '6065']
[EX A]: 734

[EX Q]: 4, 10, ['d', 'D', 'A', 'p', 'P', 'W', '5359', '7219', '8977', 'I', 'F', 'P', '1623', '1833', '6825', '8373', 'F', '8689', 'N', '7349']
[EX A]:
21555