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.

1, 3, ['c', '2957', 'u', '2321', 'q', 'P', '2347', 'O', 'P', '4463', 'u']
2957

2, 22, ['Y', '203', 'i', 'b', '2019', '7785', 'u', '9161', 'k', '6543', 'h', '5221', 'Z', 'i', 'B', '4521', 'I', 'Z', '4959', '8841', 'd', 'p', 'i', 'R', 's', '7297', 'y']
49253

6, 8, ['4741', 'P', '8511', '399', 'j', '541', '9723', '5045', 'v', 'k', '1687', '9591', '9903', '9375', 'V', '237', '9061', '5419', '4459', '2337', '2871', 'P']

15309