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]: 7, 15, ['k', '7859', '7463', 'f', 'd', 'L', 'O', 'K', '4629', 'n', 'T', '3785', 'I', 'o', 'Q', '8331', 'U', 'W', '2311', 'u', '5821', '9193']
[EX A]: 8414

[EX Q]: 3, 5, ['b', 'a', 't', 'l', '8337', 'L', '913', 'O', '1009', '3615', 'u', 'E', 'Y', 'h', '51', '1673']
[EX A]: 8337

[EX Q]: 2, 15, ['s', '3687', 'C', '317', '8337', 'i', '5357', '6281', 'S', '8411', '7923', 'j', 'O', '4755', '5141', 'W', 'J', 'z', '3111', '6041', 'S', '3555', '581', '1785', '4045', 'e', 'z', '1081']
[EX A]:
50209