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]: 4, 13, ['2921', '5905', '2835', '3625', '2481', '1657', '6239', '2393', 'u', '3255', '7061', '8197', 'k', '269', '1135', '5833', '7847', 'C', '4371', '4783', '9613']
[A]: 34908


[Q]: 1, 4, ['o', 'O', '7355', 'S', '2513', 'f', '4189']
[A]: 7355


[Q]: 9, 10, ['8317', '2249', 'C', 'S', '4627', 'W', 'j', '493', '7345', '2847', '3953']
[A]:
10192