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]: 1, 15, ['p', 'N', '7935', '1649', '1509', 'N', 'q', 'L', '1917', '9753', 'C', '6387', '4037', 'D', '1099', '5329', '1703', '7715', 'c']
[EX A]: 34286

[EX Q]: 15, 24, ['987', '1799', 'q', '4969', '7401', 'M', '1637', '423', 'D', '2883', 'O', '5667', 'z', 'k', '6791', 'O', 'o', '4693', '6961', 'E', 'k', 'm', 'g', 'O', '7131', 'I', '7671']
[EX A]: 18445

[EX Q]: 6, 10, ['S', '6423', 'R', 'y', '7441', '7565', '13', 'h', '9993', 'M', '7021', '6941', '9781']
[EX A]:
17571