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, 1, ['R', '3969', 'O', '3281', 'X', '5173', 'K', 'G', 'm', 'Y', '4981', 'x', '9127', 'X', 'w', 'm', '3873', '5887', '7405', 't', 'P', 'K', '8459', '9699']
[EX A]: 0

[EX Q]: 3, 8, ['g', 'D', 'W', 'q', '7817', '9295', '2385', 'V', 'c', '7761']
[EX A]: 19497

[EX Q]: 7, 24, ['Y', 'u', 'U', '4165', 'P', '6601', 'G', '7515', 'n', '173', '5505', 't', 'P', 'm', '3153', '509', 'S', '6219', 'a', 'K', 'M', '1255', 'k', '7187', '3229', '3317', '1399']
[EX A]:
31516