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.

7, 7, ['S', 'a', '1011', '673', '7777', '8529', 'Y']
0

3, 5, ['6621', 'A', '3201', '9737', '7957', 'v', 'x', 'q', 'b', 'X', 'v', 'B', 'h', '3985', 'M', '3037', 'V']
20895

7, 27, ['4957', '7521', 'I', 'Y', 'X', 'E', '4867', '7125', '6627', 'P', '2735', 'u', 'i', 'D', 'C', '4357', 'E', 'N', '9859', 'b', 'g', '6609', '661', '7297', '1753', '8421', 'C', 'p']

60311