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, 6, ['H', '7937', '9919', 'G', 's', '1929', '8585', 'n', 'u', 'J', 'C', '387']
[A]: 19785


[Q]: 1, 3, ['b', '3997', '285', 'T']
[A]: 4282


[Q]: 6, 8, ['845', '319', '9409', 'a', 'q', 'C', '6819', 'P', '7997', 'i', '3919', 'E']
[A]:
6819