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.

3, 5, ['b', 'a', 't', 'l', '8337', 'L', '913', 'O', '1009', '3615', 'u', 'E', 'Y', 'h', '51', '1673']
8337

11, 12, ['2735', '2057', '8217', '7745', 'p', '165', 'e', 'g', 'c', '2391', '523', 'R', '1009']
523

1, 4, ['h', '9971', 'w', '3401', 'w', 'T']

13372