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.
20, 20, ['k', '7985', '23', 'z', 'N', 'a', '3039', '6517', '9731', '1283', '8993', 'V', '2337', '5315', '6293', '1629', 'R', '891', '825', 'R']