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, 17, ['w', '351', 'v', '795', '7543', 'i', 'L', 'x', 'A', 'o', '1645', '5775', '1679', 'S', '1713', '6559', '8705', 'W', 'c', 'X', 'B', '7559', 'D', '1651']