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.

2, 5, ['601', '9381', '2073', '5113', '9595', 'P', '9499', '7561', '9343']
26162

25, 27, ['6411', '2467', 'y', '4973', 'C', '8853', 'H', 'G', 'a', 'N', '3759', '7803', '5403', 'Z', '4047', '6283', 'v', '5437', 'p', 't', 'S', '7605', 's', 'Z', '7537', 'Y', 'U', 'W', '2147', 'K']
7537

2, 3, ['d', '5947', 'Q', '1657', 'M', 'q', 'q']

5947