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]: 3, 4, ['1809', '1127', 'm', '3137']
[EX A]: 3137

[EX Q]: 11, 13, ['L', 'v', 'o', '8089', 'u', '7105', '4451', '9785', 'e', 'p', 'p', '7077', '2815', 'v', 'p', '3593', 't', '6771', 'd', '2651']
[EX A]: 9892

[EX Q]: 7, 10, ['x', '5009', 'v', 'K', '5551', 'Z', 'D', 'Z', '4865', '5857', 'B', 'Y', '7041', 'L', '4673', 'l']
[EX A]:
10722