Fibonacci numbers are built like this: the first two are 1, and each next number is the sum of the two before it. Write a function fibonacci_digit_index that finds the index of the first Fibonacci number containing exactly d digits. Indexing starts from 1, so the first number in the sequence is F1.

def fibonacci_digit_index(d: int) -> int: