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]: 13, 14, ['7395', '8249', 'n', '935', 'q', 'P', '7179', '2683', '8163', '4747', '2501', 'z', '7601', '7115', 'y', '53']
[EX A]: 14716

[EX Q]: 3, 4, ['1809', '1127', 'm', '3137']
[EX A]: 3137

[EX Q]: 6, 17, ['L', '3341', 'v', '2051', 'Q', 'i', 'r', 'h', 'f', 'C', 'W', '2493', 'W', '5835', 'F', 'A', 'j', 'g', 'E', 'w', 'E', 'U']
[EX A]:
8328