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, 10, ['7435', 'B', '7841', '5901', 'I', '6255', 'g', 'F', 'D', '1839', '3651', 'Q', '1629', 'T', '3423', 'y', '9597', '8453', '8541', 'a', '357', 'k', 'P']
Example Output: 8094

Example Input: 7, 7, ['S', 'a', '1011', '673', '7777', '8529', 'Y']
Example Output: 0

Example Input: 3, 26, ['9121', '5725', '1221', 'h', 'x', 'M', '7123', '7385', '5887', '5169', 'U', 'U', 'c', 'g', '725', 'o', 'U', 'K', 'p', '8733', 'V', '1215', 'e', 'T', '8633', 'P', '3913', 'J', 'C']
Example Output:
46091