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.

[Q]: 4, 7, ['6307', 'N', '5209', 'M', 'k', 'd', '6933']
[A]: 6933


[Q]: 3, 21, ['X', 'Z', '749', '5557', '9991', 'T', '3461', '335', 'I', 'J', '7113', 'b', '2683', '653', '3951', '4193', 'J', '7179', 'G', 'Y', '6151', '2873', 'X', '5619', '5151', '7689', '5605', 'o']
[A]: 52016


[Q]: 5, 13, ['O', '4183', 'h', '4505', '7435', 'S', '4521', '3969', 'q', '3095', 'k', 'V', '9643', '2191']
[A]:
28663