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, ['j', '3613']
[EX A]: 3613

[EX Q]: 2, 12, ['Y', '5063', 'S', 'u', 'k', 'i', '7319', '6513', '9547', '6537', 'h', '6079', '8767', '2057', '1063', 'l']
[EX A]: 41058

[EX Q]: 11, 15, ['v', '9511', '4519', '795', '7321', 'd', '7779', 'W', 'F', 'a', 'S', '5265', 'V', '6431', 'F']
[EX A]:
11696