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]: 1, 12, ['m', 'f', 'y', '2363', '9555', 'E', 'm', 'J', '1977', 'z', '3733', '9745', 'm', 'u', '1033', 'x', '7351', 'O', 'W', '8311', '955', '8643', 'D', 'e', 'z', 'M', '5139', 'o', 'a']
[EX A]: 27373

[EX Q]: 2, 9, ['i', 'C', '833', '1739', 'M', '2417', '5807', '2287', '9765', '3661', '9095', 'j', '1943', '2905', 'F', 'C', '4941', '117', 'G', 'j', '8567', 'I']
[EX A]: 22848

[EX Q]: 1, 5, ['u', 'Q', '2175', '7421', 'x', '9431', '5337', 'M', 'g', '4455', 'V', 'W', 'w', 'V', 'H', 'f', 'f', 'O', '4159', 'y', '8873', '7435', '5455', '1395', 'D', 'T', 'q', '5729', '5089']
[EX A]:
9596