------
## 最终结论
```python
from typing import List

def superPow(a: int, b: List[int]) -> int:
    def quick_pow(x: int, k: int) -> int:
        result = 1
        x = x % 1337
        while k > 0:
            if k % 2 == 1:
                result = (result * x) % 1337
            x = (x * x) % 1337
            k //= 2
        return result

    result = 1
    length = len(b)
    for i in range(length):
        result = (result * quick_pow(a, b[length - 1 - i])) % 1337
        a = quick_pow(a, 10)

    return result
```