Please solve the programming task below using a self-contained code snippet in a markdown code block.

Given an integer k, return the minimum number of Fibonacci numbers whose sum is equal to k. The same Fibonacci number can be used multiple times.
The Fibonacci numbers are defined as:

F1 = 1
F2 = 1
Fn = Fn-1 + Fn-2 for n > 2.

It is guaranteed that for the given constraints we can always find such Fibonacci numbers that sum up to k.
 
Please complete the following python code precisely:
```python
class Solution:
    def findMinFibonacciNumbers(self, k: int) -> int:
```