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: 9, 12, ['8515', '4987', '7905', 'K', 'u', '2791', 'o', '8955', 'j', 'x', 'e', 'Z', '6231', '4913', '7933', '4079', '2945', '475', '6415', 'V', '8767', 't', 'c', '919', 'M', '5501', 'y', 'S', 'L', 'Q']
Example Output: 0

Example Input: 18, 24, ['3493', 'T', '2499', 'l', '543', 'Y', '2247', '2665', 'y', 'z', 'a', 'H', '1057', '2401', '5587', 'w', 'N', 'n', 's', 'H', 'u', 'N', '757', 'u', 'R']
Example Output: 757

Example Input: 16, 24, ['u', '6097', '5097', 'A', '2501', 'Z', '2755', 'p', '5257', 'H', 'I', '8833', '7879', 'J', 'S', 'u', 'V', '4517', 'W', 'G', 's', '415', '9019', '807']
Example Output:
14758