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: 6, 7, ['6635', '1537', 'F', 'h', '7965', 'K', '5231', 'K', '3089']
Example Output: 5231

Example Input: 6, 19, ['u', 'E', 'b', 'w', '3633', '9577', 'f', '5915', '5543', 'V', '7015', 'j', 'X', '5343', '7853', 'A', '427', '4793', 'q', '7737', 'A', '4397']
Example Output:
46466