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, 1, ['1449', '1257']
[EX A]: 1449

[EX Q]: 9, 13, ['x', '4589', 'q', 'X', 'Q', 'e', '8007', '5779', 'Z', '8503', 's', '6425', '133', '5389', 'e', '9477', '3763', 'Q', 'B', 'r', 'P']
[EX A]: 15061

[EX Q]: 1, 10, ['4689', 'j', '1421', '7749', '2509', '49', '189', '3063', '1439', 'o', '3413']
[EX A]:
21108