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: 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: 5, 9, ['9069', 'U', '6879', 'q', '8619', '5335', '8765', '7825', '9621', 'H', '9769', 'E', 'v', '1921']
Example Output: 40165

Example Input: 21, 22, ['w', '5787', '6553', '7761', '6467', 'L', '1785', 'U', 'Q', 'J', '6481', 's', '8141', 'v', 'A', '2913', 'a', '9425', 'O', 'y', '8575', '2071', '9083', '1485']
Example Output:
10646