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, 15, ['t', '77', '6593', '3683', '5673', '9391', 'Y', 'A', '3273', '379', '6569', 'l', 'u', '8633', 'M', '8587', '3127', '5885', '4083']
[A]: 44271


[Q]: 2, 15, ['l', '5597', 'M', 'l', '6065', '7949', 'e', '433', '8159', 'N', 'Z', '5597', 's', 'k', '6973', '8387', 'n', 'W', '9895']
[A]: 40773


[Q]: 2, 13, ['o', '5453', '6389', 'i', 'p', 'W', 'o', '195', '7621', 'y', 'W', 'w', '5275', '5041', 'Z', 's', '9493', 't', '6979', 'r', 'Z', 'f', 's', '1009', '8115']
[A]:
24933