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, 9, ['7111', '835', 'W', '6975', '4459', 'B', 'B', 'Z', 'o']
[EX A]: 12269

[EX Q]: 15, 20, ['o', '7647', 'E', '5963', 'Y', 'B', 'F', 'v', '9553', 'h', 'B', 'L', '8709', '5253', '9337', 'r', '6107', '3099', '8217', '7597', '9571', '5453', '8367']
[EX A]: 34357

[EX Q]: 2, 5, ['P', 'Q', 't', 'Y', '9405', 'p', 'G', 'i', 'o', 'g', 'R', 'J', 'J']
[EX A]:
9405