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, 16, ['a', '2439', 'p', '6759', 'z', '2233', 'q', '1447', 'Y', 'k', 'Y', 'Y', '4489', 'N', '5251', '5367']
[EX A]: 18787

[EX Q]: 6, 8, ['s', 'X', 'a', 'L', 'N', 'J', '1893', '4909', '349', '7679', '4479', 'i', '7345']
[EX A]: 6802

[EX Q]: 17, 25, ['Q', 'q', 'f', 'D', 'M', '9389', 'M', 'h', '3487', '7255', '8077', '6213', '2439', '9617', '5257', 'K', '6419', 'r', '4531', 'x', 'q', '9141', 'w', '7363', 'B', 'R']
[EX A]:
27454