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]: 1, 14, ['T', 'y', 'L', 'l', '5307', 'j', '2235', '9617', 'e', '7687', 't', '4357', '1745', 'X', '8485', 'a', '1387', '1351', '6437', 'u']
[EX A]: 30948

[EX Q]: 8, 9, ['P', 'V', '5567', 'm', 'V', '9533', '2381', '1095', '835', 'B', 'z', 'J', 'H', 't', 'b', 'z', 'e']
[EX A]: 1930

[EX Q]: 1, 1, ['Y', '1419', 's']
[EX A]:
0