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.

[EX Q]: 1, 7, ['Y', 'n', '8993', 'X', '7211', 's', 't', 'R', 'm', 'L', '9559', 'K', 'j', '791']
[EX A]: 16204

[EX Q]: 8, 9, ['P', 'V', '5567', 'm', 'V', '9533', '2381', '1095', '835', 'B', 'z', 'J', 'H', 't', 'b', 'z', 'e']
[EX A]: 1930

[EX Q]: 9, 29, ['A', 'J', 'w', 'I', 'X', 'T', '2161', 't', '271', '6941', 'B', 'y', '6505', '6859', '3981', 'H', 'H', 'S', '8977', '9497', '8715', '3207', '6251', 'D', 'D', 'v', '841', '6479', '9053', 'u']
[EX A]:
77577