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.

[Q]: 1, 14, ['T', 'y', 'L', 'l', '5307', 'j', '2235', '9617', 'e', '7687', 't', '4357', '1745', 'X', '8485', 'a', '1387', '1351', '6437', 'u']
[A]: 30948


[Q]: 4, 4, ['2107', 'l', '7551', '4907']
[A]: 4907


[Q]: 10, 17, ['479', '9493', '9061', '5585', 's', '9653', '5741', '7451', '2141', '9547', 'r', 'Z', '8915', '8289', '9281', '561', 'J', '3029', '3595', '7279', '7641']
[A]:
36593