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]: 12, 14, ['U', '5071', 'V', '9887', 'E', '3913', '3459', 'l', 'V', 'n', 'B', '655', 'L', 's', '2687', '9761', '2477', 'D', '8385', 'U', 'm', 'q', '4365', 'j']
[A]: 655


[Q]: 1, 9, ['6607', '6185', 'X', 'd', 'T', 't', 'Y', 'p', '2789', 'a', '7365', 'k', 'n', '1853', 'x', 'F', '5523', '2827', '1441', 'F', 'c', 'i', 'n', 'h', '3633']
[A]: 15581


[Q]: 12, 21, ['2013', 'E', 'u', '435', '909', 'H', 'f', 'y', '3479', '7453', 'h', '9193', 'G', '1947', 'k', 'q', '4119', '489', 'A', 'L', 'Y', '9753', 'u', '8129', 'Q', 'Q', '2991', 'l']
[A]:
15748