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.

10, 16, ['Q', '931', 'P', '6777', 'X', '3855', 'i', '1055', 'd', 'p', '7947', 'z', 'X', 'h', 'g', 'w', 'r', 'T']
7947

14, 18, ['y', '4021', '9011', '3447', '6467', '5599', 'T', 'g', '1441', 'e', '2857', '7251', 'D', '619', '6413', '3145', '9355', 'O', 'Z', '6521', '5005', 'Q']
19532

7, 16, ['t', '4299', 'Z', 'H', '3835', '2809', 'j', 'J', 'l', '873', 'z', 'm', '1659', 'X', 'H', '9259', 'e', 'K', '4305', '3887']

11791