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, 2, ['9769', 'z', '6349', 't', '9391', '7181', '2405', 'j']
9769

9, 9, ['8073', 'i', '5725', 'j', '4631', 'h', '245', '2191', '2445', '267', 'V', 'D', '3385', 'W']
2445

15, 16, ['2881', '3223', '569', '8711', 'o', 'h', '9497', '4603', '3733', '7561', 'e', '4893', 'T', '9025', '1665', '9751', 'U', '4847']

11416