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

[EX Q]: 10, 22, ['4049', '2745', 'g', 'T', 'N', 'u', 'Q', '3687', '5871', 'i', '9139', '585', '8435', '5761', '5825', '5909', 'f', '6317', '8227', '4051', 'E', '5167', '6953', 'g', '4113', '2493']
[EX A]: 59416

[EX Q]: 8, 12, ['2315', 'B', 'V', '4243', '4733', '2293', 'R', 'v', '2219', 'W', 'a', '6227', 'Q', '1177', '8919', 't', 'z', 'e', '959', 's', 'w', 'n', 's', 'j', '7933']
[EX A]:
8446