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: 8, 12, ['v', 'N', '8123', '1677', '5743', '8657', 'S', '5073', 'Y', 'R', '2781', '6583', 'A', '1989', 'S', '9301', 'y', 'j', '1759', 'U', '9951', 'W', '5967', 'a', 'c']
Example Output: 14437

Example Input: 5, 13, ['8179', '2435', 'w', '6965', '2003', 'c', '2091', 'w', '225', 's', 'k', '4281', '1931', '3351', 'o', 'f', 'Y', 'm', '8223', 'X', 'H', 'X']
Example Output: 10531

Example Input: 1, 6, ['N', '5853', 'R', '3599', 'g', 'K', 'A', '4847', '7519', '6385', 'T', '9601', 'Z', 'W', 's', 'u']
Example Output:
9452