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.

Ex Input:
6, 11, ['m', '455', 'u', 'C', 'b', 'N', 'A', 'W', 'M', '3811', 'K', '657', 's', '2839', 'E', 'E', '2733', '6733', 'c', 'P', 'V']

Ex Output:
3811


Ex Input:
1, 2, ['8895', 't', '5739']

Ex Output:
8895


Ex Input:
3, 16, ['2753', 'P', 'f', '1779', 'I', 'h', 'v', 'A', 's', 't', 'Z', '9909', '4813', '1697', 'r', 'i', '2897', '8401', 'W', '6183', '8773', '9441', '161', 'D', 'A', 's', '3333', '5769', 'D']

Ex Output:

18198