Homework  author Patryk Mikos
Write a function `f` with takes arguments `n` and `p` and returns {fn: n-th fibonacci number (f0 = 0, f1 = 1), sum: sum of all fibonacci numbers less or equal fn modulo p}. For incorrect arument return `-1, -1`.