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.

6, 11, ['m', '455', 'u', 'C', 'b', 'N', 'A', 'W', 'M', '3811', 'K', '657', 's', '2839', 'E', 'E', '2733', '6733', 'c', 'P', 'V']
3811

5, 10, ['3907', '1629', 'v', '6711', '8347', 'E', '4067', 'T', '1665', '5735', '4879']
19814

3, 6, ['r', '8615', '4477', 'k', 'Z', 'B']

4477