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: 2, 15, ['r', '3527', 'Z', '9011', 'm', '879', '5305', '7153', 'c', '3567', 'd', '2319', 'M', 'y', '7703', '4899', 'G']
Example Output: 39464

Example Input: 11, 13, ['O', '4429', 'F', '2013', 'v', 'p', 'y', '507', 'g', '935', '1827', 'Q', '4267', 'A', 'm', 'g', 'k', 'S', 'a', 'C', 'q', 'W', 'M']
Example Output: 6094

Example Input: 10, 11, ['A', 'H', 's', '8033', 'M', '7393', '1231', 'T', '5025', '1739', 'q', '4233']
Example Output:
1739