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]: 4, 8, ['3573', '9813', '3867', 'i', '5291', '1987', '9811', 'A']
[EX A]: 17089

[EX Q]: 4, 13, ['d', 'v', 'K', '2011', '7323', '5735', 'u', '4227', 's', 'n', '1161', 'm', '5463', 'I', '2813']
[EX A]: 25920

[EX Q]: 19, 23, ['8877', '8293', 'a', '925', 'c', 'i', 'u', 'U', 'C', '9095', 'E', '5411', '9469', 'h', 'T', '7195', 'T', '909', '6709', '1777', 'S', 'r', '5073', '5835']
[EX A]:
13559