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]: 2, 5, ['9615', '7859', 'D', 'J', '1471']
[EX A]: 9330

[EX Q]: 22, 25, ['875', 'x', '229', 'c', '6921', '2739', '8299', '2043', '9471', 'N', '8051', 'K', 'k', 'l', '7453', '8873', '5807', 'p', 'U', 'G', 'R', 'w', '4367', '3631', 'j', 'G', '7537', 'l', 'D', 'q']
[EX A]: 7998

[EX Q]: 7, 12, ['6973', 'a', 'S', 'A', 'L', 'c', '9605', '2987', 'i', 'Q', '4309', 'D', 'z', '9039', 'k', '8409', 't', '1999', '4525']
[EX A]:
16901