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, 6, ['l', 'C', '6183', 'd', '6519', 'm']
Example Output: 12702

Example Input: 4, 18, ['b', 'K', 'Z', '8757', '691', '8915', 'l', '2819', '9599', '4149', '8791', '7815', '7211', '1973', 'w', '5557', '1071', '2483', '9851', 'x', '5441', '2787', '3723', '5981', 'o', '1045', 'z']
Example Output: 69831

Example Input: 9, 27, ['5923', 'g', 'X', '4139', '3173', 'v', '7295', 'f', '9221', 'M', 'D', '5579', '2089', 'A', 'J', 'v', 'c', '9779', 'U', 'F', 'r', '6449', '2059', '6417', '9195', 'R', 'x', '1961']
Example Output:
50788