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.

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


[Q]: 3, 4, ['h', 'w', 'L', 'L']
[A]: 0


[Q]: 4, 8, ['B', 'A', 'Y', 'F', 'K', 'D', '1947', '1933', 'O', '4291', '1085']
[A]:
3880