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]: 2, 5, ['m', 'o', 't', 'c', 'S', 'R', 'I', '4937', '1127', '1611', '285', '3653', '309', 'y', '513', 'i', '8005', 'n', '6915', '8585', 'G', 'A', '1921', 'd']
[A]: 0


[Q]: 4, 6, ['X', '7577', 'N', 'F', '2783', 'a', 'u', 'R', '9877', 'x', 'f', 'J', '6343']
[A]: 2783


[Q]: 10, 22, ['9125', 'm', '4621', 'k', '9381', '3381', '8989', '9279', '517', 'R', '969', 'D', 'O', '5995', '5117', 'M', 'G', 'R', '819', 'Q', '1471', 'a', '5121', 'w', '6927', 'i']
[A]:
14371