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.
6, 10, ['6521', '5347', 'X', '9715', '4691', 'K', 'G', 'k', 'O', 'W', '2229', '9765', 'v', '5533', 'D', '3519', '1343', '2525']