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.
5, 12, ['9709', '3291', 'J', '5365', 'w', 'K', 'v', 'x', '3023', '6275', 'y', 'X', '2749', '3111']