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, 10, ['r', 'A', 'l', '7169', '3249', 'T', 'O', 'g', 'F', 'M', 'R', '171', 'M', '2449', '3749', 'f']
[EX A]: 10418

[EX Q]: 14, 18, ['u', '649', 'A', '3683', '5549', 'd', 'S', 'O', '1589', '163', '7773', 'a', 'J', 'z', '9529', 's', '3821', '7851', '1375']
[EX A]:
21201