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, 21, ['7753', '4315', '7527', 'R', 'W', 'a', '3983', 'w', 'F', '8967', 's', 'Y', 'D', 'I', '5305', '2535', 'u', '135', 'M', 'D', 'G', 't', 'r', 'g', 'W', 'V', '3461', 'P', 'T', 'd']
32767

5, 6, ['937', '3595', '1279', '8705', '3587', '5879']
9466

9, 12, ['4189', '4575', 'i', 'e', 'Y', '5595', 'U', 'M', 'b', 'n', '5347', 'v', 'w', 'Z', 'F', '503', 'G', '4429', '3087', '295', 'W']

5347