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, 13, ['d', 'v', 'K', '2011', '7323', '5735', 'u', '4227', 's', 'n', '1161', 'm', '5463', 'I', '2813']
[EX A]: 25920

[EX Q]: 1, 3, ['p', '5665', '3001']
[EX A]: 8666

[EX Q]: 1, 8, ['k', 'Z', 'T', '7965', 'M', 'Y', 'w', 'H', '789', 'o', 'J']
[EX A]:
7965