#include <cstdio>

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

#define maxn 100005

#define mod 19961993

#define ll long long

struct TreeNodeType {

    ll l,r,mid;

    ll dis1,dis2;

};

struct TreeNodeType tree[maxn<<];

ll n,m,cntp;

ll bit[],ans1,ans2,pi_[],pi[];

bool if_p[];

inline void in(ll &now)

{

    char Cget=getchar();now=;

    while(Cget>''||Cget<'') Cget=getchar();

    while(Cget>=''&&Cget<='')

    {

        now=now*+Cget-'';

        Cget=getchar();

    }

}

ll poww(ll pos)

{

    pos%=mod;

    ll mi=mod-,res=;

    while(mi)

    {

        if(mi&) res=(res*pos)%mod;

        mi>>=,pos=(pos*pos)%mod;

    }

    return res;

}

void tree_build(ll now,ll l,ll r)

{

    tree[now].l=l,tree[now].r=r;

    if(l==r)

    {

        tree[now].dis1=bit[],tree[now].dis2=;

        return ;

    }

    tree[now].mid=l+r>>;

    tree_build(now<<,l,tree[now].mid);

    tree_build(now<<|,tree[now].mid+,r);

    tree[now].dis1=tree[now<<].dis1|tree[now<<|].dis1;

    tree[now].dis2=tree[now<<].dis2*tree[now<<|].dis2%mod;

}

void tree_to(ll now,ll to,ll dis1,ll dis2)

{

    if(tree[now].l==tree[now].r)

    {

        tree[now].dis1=dis1,tree[now].dis2=dis2;

        return ;

    }

    if(to<=tree[now].mid) tree_to(now<<,to,dis1,dis2);

    else tree_to(now<<|,to,dis1,dis2);

    tree[now].dis1=tree[now<<].dis1|tree[now<<|].dis1;

    tree[now].dis2=tree[now<<].dis2*tree[now<<|].dis2%mod;

}

void tree_query(ll now,ll l,ll r)

{

    if(tree[now].l==l&&tree[now].r==r)

    {

        ans1|=tree[now].dis1;

        ans2=(ans2*tree[now].dis2)%mod;

        return ;

    }

    if(l>tree[now].mid) tree_query(now<<|,l,r);

    else if(r<=tree[now].mid) tree_query(now<<,l,r);

    else tree_query(now<<,l,tree[now].mid),tree_query(now<<|,tree[now].mid+,r);

}

int main()

{

    for(ll i=;i<=;i++)

    {

        if(!if_p[i]) pi[++cntp]=i;

        for(ll j=;pi[j]*i<=&&j<=cntp;j++)

        {

            if_p[i*pi[j]]=true;

            if(i%pi[j]==) break;

        }

    }

    for(ll i=;i<=;i++)

    {

        pi_[i]=poww(pi[i]);

        if(i==) bit[i]=;

        else bit[i]=bit[i-]<<;

    }

    in(n);tree_build(,,maxn-);

    ll op,ai,bi;

    for(;n--;)

    {

        in(op),in(ai),in(bi);

        if(op==)

        {

            ll pos=;

            for(ll i=;i<=;i++) if(bi&&(bi%pi[i]==)) pos+=bit[i];

            bi%=mod;tree_to(,ai,pos,bi);

        }

        else

        {

            ll ans;ans1=,ans2=,tree_query(,ai,bi),ans=ans2;

            for(ll i=;i<=;i++) if(bit[i]&ans1) ans=(ans*((pi[i]-)*pi_[i]%mod))%mod;

            printf("%lld\n",ans);

        }

    }

    return ;

}