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]: 10, 13, ['z', 'h', '141', '7351', '3683', '2199', '1981', '107', 'Y', 'E', 'G', 'P', '9677', 'O', 'e', '1661', 'f', '1367', 'b', '8531']
[A]: 9677


[Q]: 11, 14, ['H', '4643', 'k', '9583', 'K', '3497', 'Q', '8111', '1837', 'Z', '6885', 'L', '1759', '7777', '3137']
[A]: 16421


[Q]: 10, 12, ['9755', 'z', '1873', 'g', 'G', 'J', 'G', 'q', 'x', 's', '8605', '2561', '649', '9867', 't', 'a', 'z', '7717', 'R', '6099', 'T', 'a', 'i', '5323']
[A]:
11166