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, 15, ['k', 'z', 'D', '4827', '8921', 'o', 'e', 'U', 'f', '7419', 't', 'Z', 'c', '4089', '1117', '2309', '9095']
[EX A]: 26373

[EX Q]: 1, 2, ['5605', '6415']
[EX A]: 12020

[EX Q]: 3, 21, ['x', 'j', 'r', '5023', 'W', 'E', '203', '3567', 'i', 'C', '3273', 'x', '8255', 'f', '4201', '5247', 'N', 'J', 'c', 'L', '5', '6143', '6997', 'h', 'a', 'Z', '7837', 'X']
[EX A]:
29774