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]: 6, 7, ['1595', '1523', '157', 'I', '3929', '6313', 'H', 'f', 'e', '93', '5625', 'b', 'J', 'b', '1185', '1505', 'I', 'y', '4043']
[EX A]: 6313

[EX Q]: 21, 27, ['2789', '3875', '2351', 'Y', '1127', 'J', 'Z', '5187', 'c', '8115', '3459', 'Y', 'f', 'o', 'L', 'H', '2931', '879', 'L', 'e', '3745', '173', 'v', 'W', '9393', 'Y', '7651']
[EX A]: 20962

[EX Q]: 17, 30, ['1221', '5615', 'i', 'e', 'u', '8601', 'K', '3447', '9625', '5397', '4047', 'r', 'W', '7125', '8727', 'y', 'u', 'e', '7181', '9063', 's', '2435', '3793', 'o', 'I', '6929', 'N', '1119', 'm', '8405']
[EX A]:
38925