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.

Example Input: 2, 11, ['8237', '8149', '7077', '2199', '7839', 'c', 'j', 'Y', '845', '2273', 'n', 'Q']
Example Output: 28382

Example Input: 16, 20, ['8615', '8269', 'k', 'R', 'l', '9823', '6879', '7777', 'w', '8443', 'W', '6951', 'Q', '8251', 'M', 'g', 'F', 'w', 'C', '7267', 's', '973', '4703', '8921']
Example Output: 7267

Example Input: 3, 20, ['v', 'r', 'G', '4329', '4811', 'l', 'A', 'y', '5201', '9495', 'W', 'U', '4751', '6497', '8689', 'Y', '4121', '7885', '5383', 'X', 'H', 'a', 'q', '1441']
Example Output:
61162