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]: 13, 14, ['5297', 'V', '7495', '6967', 'b', 'w', 'a', '2403', 'V', 'n', '525', 'd', 'o', 'm', '3439', '4245', '6381', '5743', 'P', '1047']
[A]: 0


[Q]: 11, 19, ['Y', 'r', 't', '2931', '9519', '1071', '2417', 'p', 'F', '7509', 'l', '3451', '1907', 'z', 'E', 'n', '1251', 'k', 'p']
[A]: 6609


[Q]: 1, 17, ['W', '1099', '4013', '1731', '8851', '4089', 'x', '6481', 'w', '6367', 'o', 'Q', 'V', '9039', '4547', '7035', '989', '2077', 'm', 'K', '7421', '6223', 'Q', 'v', '7073', 'H', '5225']
[A]:
54241