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]: 14, 18, ['4235', 'd', '7915', '2595', '1123', '475', '7987', '287', '4659', '45', '737', 'l', 'Z', '5245', '8021', 'g', 'D', '9801', '2327', '339']
[EX A]: 23067

[EX Q]: 1, 7, ['2085', '5455', 'l', 't', 'D', 'X', '523']
[EX A]: 8063

[EX Q]: 4, 5, ['J', 'b', 'M', '1053', 'x', 'T', '3139', 'b', '6579', 'f', 'a', 'i', '3939', 'M']
[EX A]:
1053