// #include<cstdio>
#include<cmath>
#include<map>
#include<iostream>
using namespace std;
map<int,int>mp;
inline int fib(int n ) {
    if(mp.find(n)!=mp.end())return mp[n];
    long long a = fib(n-1) + fib(n-2) ;
    a %= 100000000 ;
    mp[n] = int(a) ;
}
inline int __gcd(int a , int b) {
    while(b ^= a ^= b ^= a %= b);return a;
}
int main() {
    int n , m ;
    cin >> n >> m;
    cout<<fib(__gcd(n,m));
    return 0;
}