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.

1, 11, ['R', 'k', '4813', '655', '3185', 'M', '4199', '1857', '9829', '6389', 'X', '3405', 'P', 'x']
30927

7, 18, ['o', '3007', '4747', '869', 'H', '7455', 'U', 'G', '6009', 'H', 'p', '381', '5217', 'q', '1251', 'G', 'i', 'X', '7649', '415', '8053', 'o']
12858

14, 18, ['6813', '2461', 'J', 'Q', '1967', 'p', '3121', 'y', '9691', 'R', '3395', 'z', 'c', 'm', 'G', 't', 'w', '4417', 'z', 'O', 'E', 'r', 'l', 'b', 'c']

4417