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, 4, ['1261', 't', 'h', '3615', '7919', 'k']
[EX A]: 4876

[EX Q]: 9, 13, ['2813', 's', 'z', 'G', '5927', '4415', 'T', 'c', '7029', 'e', 'o', 'd', '5913', 'y']
[EX A]: 12942

[EX Q]: 12, 22, ['j', 'p', 'Y', 'b', 'a', '275', '8527', '2515', '7111', '9585', '9823', '1907', 'D', '1041', 'H', '2677', '6227', 'm', '8613', '5479', '4493', 'Z', 'Q', 'v', 'c', 'L', '8605', 'J', '6035']
[EX A]:
30437