#include<bits/stdc++.h>
#define ll long long
#define mod 9901
using namespace std;
ifstream f("sumdiv.in");
ofstream g("sumdiv.out");
ll a, b;
ll log_pow(ll x, ll p)
{
    ll r=1;
    while(p)
    {
        if((p & 1)) r=(r*x)%mod;
        x=(x*x)%mod;
        p=p>>1;
    }
    return r;
}
ll sum_div(ll x)
{
    ll s=x+1;
    for(ll d=2; d*d<=x; d++)
    {
        if(x%d==0)
        {
            s=(s+d)%mod;
            if(d!=x/d) s=(s+x/d)%mod;
        }
    }
    return s%mod;
}
bool prim(ll x)
{
    if(x<2) return 0;
    if(x==2) return 1;
    if(x%2==0) return 0;
    for(ll d=3; d*d<=x; d+=2)
        if(x%d==0) return 0;
    return 1;
}
int main()
{
    f>>a>>b;
    ll t=1;
    //g<<sum_div(log_pow(a, b));
    while(t)
    {
        t++;
    }
    return 0;
}