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]: 2, 2, ['5189', 'J']
[EX A]: 0

[EX Q]: 4, 5, ['3365', 'x', '3373', '8905', '1527', '9433', '2907', 'j', 'x', '7201', '307', '4507', '785', '6749', '4419', '2743']
[EX A]: 10432

[EX Q]: 9, 19, ['2275', '1725', '4681', 'a', 'V', 't', '2007', 'Q', 'o', '8551', '239', '2853', '7201', '6221', '4279', 'z', '7521', 'A', 'G', '749']
[EX A]:
36865