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]: 15, 23, ['z', '4587', '8709', '977', 'J', '823', '6437', '3817', 'X', '399', '2265', '3001', '5997', '3393', 'o', '6551', '7305', '9007', '7931', '8235', 'k', 'l', '1523']
[EX A]: 40552

[EX Q]: 3, 13, ['9585', '4573', '8113', '4163', 'D', '4641', '2077', 'D', '5339', 'Y', 'Z', '9133', '9401', 'o', '5033', 'd', '1745', '1357', '5513', '5369', 'N', '9355', 'C', 'W', 'C']
[EX A]: 42867

[EX Q]: 8, 14, ['z', '7621', 'M', '5939', 'm', 'Z', '4819', '4007', '5937', '7181', 'A', '8565', '6333', 'D']
[EX A]:
32023