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: 3, 8, ['g', 'D', 'W', 'q', '7817', '9295', '2385', 'V', 'c', '7761']
Example Output: 19497

Example Input: 2, 20, ['7991', '1029', 'L', '3307', 'A', '6641', '8833', 'J', '2751', '7457', 'f', '943', 'D', '5609', '5123', '5561', 'N', '1755', '1117', 'C', 'k', '6657', '2569']
Example Output: 50126

Example Input: 1, 8, ['3629', 'B', '3261', '2297', 'L', '9979', '5627', '1137', '7413', 'T', '835', 'u', '9109', 'q', '6145', '1373', 's', 'h', 'q', 'b', 'E', '1139', '3611', '5709', 'T', '5427', 'G']
Example Output:
25930