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]: 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]: 3, 5, ['6621', 'A', '3201', '9737', '7957', 'v', 'x', 'q', 'b', 'X', 'v', 'B', 'h', '3985', 'M', '3037', 'V']
[EX A]: 20895

[EX Q]: 7, 19, ['N', 'N', '8617', '3295', '5781', 'i', '2425', 'B', '5281', 'p', 'c', 'H', 'D', 'N', '4335', 'I', '5237', 'r', '6323', 'k', '9689']
[EX A]:
23601