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: 10, 13, ['z', 'h', '141', '7351', '3683', '2199', '1981', '107', 'Y', 'E', 'G', 'P', '9677', 'O', 'e', '1661', 'f', '1367', 'b', '8531']
Example Output: 9677

Example Input: 4, 6, ['v', 'f', '5021', 'v', 'M', '6345', '1159', 'C', '8173', '6299', 'r', '8877', 'a', 'm', 'k', '2935']
Example Output: 6345

Example Input: 9, 17, ['1719', '7701', 'f', 'C', '4941', '3723', 'a', 's', '6823', 'A', '7499', '1931', 'i', '903', 'i', 'W', 'l', 'H']
Example Output:
17156