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.
1, 22, ['5937', '775', 'F', 'r', '9677', '8971', 'Q', 'n', '8139', '499', '9357', '1511', 'T', 'W', 'l', 'E', '8089', '1375', 'J', '3921', '2731', 'd', '1499', '6873']