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

1, 5, ['E', '8579', '229', 'X', '1579', 'C', '5091']
10387

2, 3, ['3605', '5569', 'P', 'S', '3035', '2097', 'g', 'b', 'v', 'd']

5569