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, 3, ['9191', 'D', '1937', 'N', 'g', '3485', '7327']
[A]: 1937


[Q]: 5, 7, ['t', 'e', 'P', 'H', 'I', 'U', 'a', '8147', 'i', 'D', 'x', 'x', 'i', 'm', '4893', '6443', '8841', 't', '4641', '9415', '1965', '673']
[A]: 0


[Q]: 2, 11, ['6971', '3763', '1067', '5615', '5987', 'f', '5629', 'g', '7725', 'O', '1571', '3939', 'S', 'j']
[A]:
31357