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: 4, 10, ['C', '6511', 'S', '5389', '5679', 'O', 'Z', 'm', 'p', '1135', '7887', '6407', '6561']
Example Output: 12203

Example Input: 6, 15, ['H', 'u', 'Y', 'Z', 'm', '1897', 'u', '2511', '507', '4977', '2019', '8913', 'Q', '5835', '1787', 'q', '1197']
Example Output: 28446

Example Input: 3, 23, ['V', '2009', 'A', '529', 'e', 'j', 'D', 'j', 'L', 'd', 'F', '2513', '2455', 'a', '3307', 'b', 'w', 'A', '7473', 'a', '2749', '6421', '7525']
Example Output:
32972