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, ['r', 'Y', '3769', 'k', '6407', 'G', 'M']
[A]: 10176


[Q]: 1, 4, ['1261', 't', 'h', '3615', '7919', 'k']
[A]: 4876


[Q]: 3, 6, ['p', '4043', 't', '3125', 'q', '4621', 'P', '3347', 'v', 'o', 'W', 'K', '3491', '483', 'q', '1679', 'k', '8317', 'n', '8007', 'n']
[A]:
7746