Denote by \(GCD(m,n)\) the greatest common divisor of numbers \(m,n\), namely the largest possible \(d\) which divides both \(n\) and \(m\). Prove for any \(m,n\) that \[GCD(F_n,F_m) = F_{GCD(m,n)}.\]