#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef __int128 INT;
#define CIN_ONLY if(1)
struct cww{cww(){
    CIN_ONLY{
        ios::sync_with_stdio(false);cin.tie(0);
    }
}}star;
#define fin "\n"
#define FOR(i,bg,ed) for(int i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define DEBUG if(0)
#define REC(ret, ...) std::function<ret (__VA_ARGS__)>
template <typename T>inline void chmin(T &l,T r){l=min(l,r);}
template <typename T>inline void chmax(T &l,T r){l=max(l,r);}
template <typename T>
istream& operator>>(istream &is,vector<T> &v){
    for(auto &it:v)is>>it;
    return is;
}
const int mod=1e9+7;
INT len1[100];
LL sum1[100];
LL mul1[100];
INT len2[100];
LL sum2[100];
LL mul2[100];

LL getsum(LL l){
    int id=60;
    LL res=0;
    while(l>0){
        while(l<len2[id])id--;
        if(len1[id]<=l&&l<=len2[id]){
            auto x=to_string((id+1)*(id+1));
            for(auto &c:x)c=c-'0';
            for(auto &c:x)if(c==0)c=10;
            REP(i,l-len1[id])res=(res+x[i])%mod;
            return res;
        }
        l-=len2[id];
        res=(res+sum2[id])%mod;
    }
    return res;
}
LL getmul(LL l){
    int id=60;
    LL res=1;
    while(l>0){
        while(l<len2[id])id--;
        if(len1[id]<=l&&l<=len2[id]){
            auto x=to_string((id+1)*(id+1));
            for(auto &c:x)c=c-'0';
            for(auto &c:x)if(c==0)c=10;
            REP(i,l-len1[id])res=(res*x[i])%mod;
            return res;
        }

        l-=len2[id];
        res=(res*mul2[id])%mod;
    }
    return res;
}
// a x + b y = gcd(a, b)
// O(log (a+b) )
LL extgcd(LL a, LL b, LL &x, LL &y) {
    LL g = a; x = 1; y = 0;
    if (b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x;
    return g;
}

// mを法とするaの逆元
// O(log a)
LL invMod(LL a) {
    LL x, y;
    if (extgcd(a, mod, x, y) == 1)return (x + mod) % mod;
    else return 0; // unsolvable
}


int main(){
    len1[0]=0;
    sum1[0]=0;
    mul1[0]=1;
    FOR(i,1,61){
        LL x=i*i;
        len1[i]=2*len1[i-1]+to_string(x).size();
        mul1[i]=mul1[i-1]*mul1[i-1]%mod;
        sum1[i]=sum1[i-1]*2%mod;
        while(x>0){
            LL y=x%10;
            if(y==0)y=10;
            mul1[i]=mul1[i]*y%mod;
            sum1[i]=(sum1[i]+y)%mod;
            x/=10;
        }
    }
    LL K,L,R;
    cin>>K>>L>>R;
    if(K>60)K=60;
    if(R>len1[K]){
        cout<<-1<<endl;
        return 0;
    }
    FOR(i,0,61){
        LL x=(i+1)*(i+1);
        len2[i]=len1[i]+to_string(x).size();
        mul2[i]=mul1[i];
        sum2[i]=sum1[i];
        
        while(x>0){
            LL y=x%10;
            if(y==0)y=10;
            mul2[i]=mul2[i]*y%mod;
            sum2[i]=(sum2[i]+y)%mod;
            x/=10;
        }
        
    }
    
    LL A=mod+getsum(R)-getsum(L-1);
    LL B=getmul(R);
    if(L!=1)B*=invMod(getmul(L-1));
    cout<<A%mod<<" "<<B%mod<<endl;
    return 0;
}