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.

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

[EX Q]: 2, 9, ['4437', 'g', 'I', 'u', '4299', '45', '4397', '5327', '5301', 'J', 'K', '4129', 'W', '8567']
[EX A]: 19369

[EX Q]: 4, 25, ['O', '9799', 'k', 'l', 'B', 'd', 'y', 'H', '1733', '9451', 'Z', 'j', 'f', 'k', 'n', 'm', '1659', 'b', '2415', '4339', 'h', 'n', '237', 'I', 'X']
[EX A]:
19834