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: 25, 26, ['9367', 'G', 'c', '4997', 'g', 'r', '2893', 'T', '6693', 'I', '5127', 'N', '4333', '6905', '8539', 't', 'y', 'f', '8341', 'e', 'g', '8749', '3525', 'g', '6263', '321']
Example Output: 6584

Example Input: 6, 8, ['x', 's', '1415', '6003', '2237', 'g', 'l', 'a', 'l', 'y', 'y', '4651', 'e', 'D', 'g']
Example Output: 0

Example Input: 20, 20, ['7113', 'Z', '3475', 'M', '5951', 'v', '175', '401', 'u', 'O', 'k', 'g', 'k', 'f', 'J', 'o', 'z', '2411', 'W', '4859', '497', '989', 'r', '4205', '9891', 'X', '7343', 'S', '5529']
Example Output:
4859