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]: 11, 12, ['S', 'f', 'V', '7983', 'O', 'k', '699', '2831', 'C', 'B', 'B', '1263', 'b', '509', '8963', '8895']
[EX A]: 1263

[EX Q]: 2, 12, ['2873', '259', 'b', '2009', 'T', '6161', '8637', 'V', 'Z', 'Z', 'q', '6935', '5311']
[EX A]: 24001

[EX Q]: 14, 15, ['3321', 't', '5411', '5105', 'J', '3875', '113', 'W', '2627', 'k', 'u', 'c', 'a', 'H', '7317', 'W', '3637']
[EX A]:
7317