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.
12, 12, ['9571', 'Y', '6129', 'D', '6387', 'G', 'v', '5415', 'a', 'y', 'Q', '5543', 'f', '2381', 'j', 'w', 'w', 'R', 'A', 'S', '2507', '8309']