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, 5, ['6621', 'A', '3201', '9737', '7957', 'v', 'x', 'q', 'b', 'X', 'v', 'B', 'h', '3985', 'M', '3037', 'V']
Example Output: 20895

Example Input: 1, 4, ['1261', 't', 'h', '3615', '7919', 'k']
Example Output: 4876

Example Input: 2, 13, ['W', '531', 'r', 'p', '1727', 'D', '9569', 'q', 'L', '2745', '4291', 'V', '3869', 'e', '1937', 'U', '7845', 'f', 'm', '2141', 'x']
Example Output:
22732