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: 2, 5, ['4311', 'E', 'q', '123', 'K', 'N', '7531', 'x', 'h', 'H', '9919', '705', '3025']
Example Output: 123

Example Input: 17, 23, ['7529', 'H', '4499', '1119', 'u', 'W', '895', 'd', '2547', 'e', '2023', 'n', '9497', '9135', 'a', '3517', 'p', '25', 'e', '7607', 'p', 'M', '9289', '7615', 'N', 'i', 'w']
Example Output:
16921