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.

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

A: 7947
****
Q: 2, 5, ['601', '9381', '2073', '5113', '9595', 'P', '9499', '7561', '9343']

A: 26162
****
Q: 3, 14, ['4437', '5651', 'K', '1177', '4729', '7783', '565', '6821', '8019', 'q', 'u', '8697', 'i', 'B']

A:
37791
****