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]: 5, 9, ['X', '6543', '1123', '5967', 'x', '9197', '2865', 'r', 'V', 'c']
[EX A]: 12062

[EX Q]: 18, 27, ['1757', 'B', '5165', 'v', 'c', '2699', '9861', '3935', 'p', 'A', '6855', '5233', '1543', 'A', 'H', 'o', 'P', '6749', '2411', 'B', 'U', 'G', '1645', '1543', 'x', '7271', '4383', 'n', '2725', 'n']
[EX A]: 24002

[EX Q]: 15, 16, ['j', '8529', 'C', '493', 'C', 'v', '9231', '3083', 'O', '3969', '4507', 'J', '6325', 'A', 'H', '4763', 'E']
[EX A]:
4763