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, 16, ['8617', '6133', '5505', '6601', 'y', 'a', '1019', 'r', 'P', 'd', 'P', '9647', '9831', 'I', 'z', 'k', '749', '8975']
[EX A]: 19478

[EX Q]: 2, 5, ['m', 'o', 't', 'c', 'S', 'R', 'I', '4937', '1127', '1611', '285', '3653', '309', 'y', '513', 'i', '8005', 'n', '6915', '8585', 'G', 'A', '1921', 'd']
[EX A]: 0

[EX Q]: 5, 5, ['m', '7637', 'n', 'q', '6067', 'B', 'd', '9129', '751', 'h', '6495']
[EX A]:
6067