#include<bits/stdc++.h>
#define int long long
#define all(v)v.begin(),v.end()
#define rall(v)v.rbegin(),v.rend()
using namespace std;
template<typename T>istream&operator>>(istream&I,vector<T>&v){for(auto&i:v)I>>i;return I;}
template<typename T>ostream&operator<<(ostream&O,vector<T>&v){for(auto&i:v)O<<i<<' ';return O;}
namespace AC{
const int mod=1000000007;
int calc(int x){
	int ret=0;
	for(int i=0;i<60;i++){
		int cnt=(x>>i)-(x>>(i+1));
		int d=to_string((i+1)*(i+1)).size();
		ret+=d*cnt;
	}
	return ret;
}
vector<int>solve(int x){
	int l=0,r=1LL<<60;
	while(r-l>1){
		int m=(l+r)>>1;
		if(calc(m)<=x)l=m;
		else r=m;
	}
	vector<int>v(10);
	for(int i=0;i<60;i++){
		int c=(l>>i)-(l>>(i+1));
		int b=(i+1)*(i+1);
		while(b>0){
			v[b%10]+=c;
			b /=10;
		}
	}
	int pos=calc(l);
	int c=1;l++;
	while(!(l&1))l>>=1,c++;
	string t=to_string(c*c);
	for(int i=0;i<x-pos;i++)v[t[i]-48]++;
	return v;
}
int modpow(int a,int b){
	int ret=1;
	while(b){
		if(b&1)ret=1*ret*a%mod;
		a=1LL*a*a%mod;
		b>>=1;
	}
	return ret;
}
int z[]={10,1,2,3,4,5,6,7,8,9};
int K,L,R;
void solve(){
	cin>>K>>L>>R;L--;K=min(K,61ll);
	int s=(1LL<<K)-1;
	if(R>calc(s))cout<<-1<<endl;
	else{
		vector<int>r1=solve(R),r2=solve(L);
		int sum=0,prod=1;
		for(int i=0;i<10;i++){
			sum+=z[i]*(r1[i]-r2[i]);
			prod=prod*modpow(z[i],r1[i]-r2[i])%mod;
		}
		cout<<sum<<' '<<prod<<endl;
	}
}
}
signed main(){
	int t=1;
	//cin>>t;
	while(t--)AC::solve();
}