#include<bits/stdc++.h>
using namespace std;
typedef long long lxl;
const int mod = 19260817;
string aa, bb;
lxl a, b;

inline lxl qpow(lxl a,lxl b){
	lxl r=1;
	for(;b;b>>=1,a=a*a%mod)if(b&1) r=r*a%mod;
	return r;
}

int main()
{
	cin >> aa >> bb;
	for(int i = 0; i < aa.size(); ++i)
		a = (1ll * a * 10 + (aa[i] & 15)) % mod;
	for(int i = 0; i < bb.size(); ++i)
		b = (1ll * b * 10 +( bb[i] & 15)) % mod;
    cout<<a*qpow(b,mod-2)%mod;
}