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]: 4, 7, ['3291', 'e', 'm', 'E', 'e', '3201', 'E', 'c', '2355', '6491']
[EX A]: 3201

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

[EX Q]: 9, 16, ['E', '7653', '3361', '4715', 'W', '7159', '3537', '8521', '2321', '9437', '9475', '4969', 't', '6985', 'B', 'I', 'w', '3583', '6383', '2555', 'T', 'M', 'Y', 'V']
[EX A]:
33187