#include <bits/stdc++.h>
using namespace std;

#define FOR(i,l,r) for(int i = (int) (l);i < (int) (r);i++)
#define ALL(x) x.begin(),x.end()
template<typename T> bool chmax(T& a,const T& b){ return a < b ? (a = b,true) : false; }
template<typename T> bool chmin(T& a,const T& b){ return b < a ? (a = b,true) : false; }
typedef long long ll;

ll K,L,R;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
const ll N = 62;
ll sum [N + 1],prd [N + 1],len [N + 1];

pair<ll,ll> rec(ll k,ll l,ll r)
{
	if(k == 0 || R < l || r < L) return {0,1};
	if(L <= l && r <= R) return {sum [k],prd [k]};
	ll x = l + len [k - 1] - 1,y = r - len [k - 1] + 1;
	pair<ll,ll> res = rec(k - 1,l,x);
	pair<ll,ll> t = rec(k - 1,y,r);
	res.first += t.first;
	(res.second *= t.second) %= MOD;
	if((L <= x + 1 && x + 1 <= R) || (L <= y - 1 && y - 1 <= R)){
		string s = to_string(k * k);
		FOR(i,0,s.size()) if(L <= x + 1 + i && x + 1 + i <= R){
			if(s [i] == '0'){
				res.first += 10;
				(res.second *= 10) %= MOD;
			}
			else{
				res.first += s [i] - '0';
				(res.second *= s [i] - '0') %= MOD;
			}
		}
	}
	return res;
}

int main()
{
	scanf("%lld%lld%lld",&K,&L,&R);
	K = min(N,K);

	prd [0] = 1;
	for(ll i = 1;i <= N;i++){
		string s = to_string(i * i);
		if(len [i - 1] == INF || len [i - 1] / 2 > INF - (int) s.size()){
			len [i] = INF;
		}
		else{
			len [i] = len [i - 1] * 2 + s.size();
		}
		ll x = 0,y = 1;
		for(const auto& it : s){
			if(it == '0'){
				x += 10;
				(y *= 10) %= MOD;
			}
			else{
				x += it - '0';
				(y *= it - '0') %= MOD;
			}
		}
		sum [i] = sum [i - 1] * 2 + x;
		prd [i] = prd [i - 1] * prd [i - 1] % MOD * y % MOD;
	}

	if(len [K] < R){
		printf("-1\n");
		return 0;
	}
	pair<ll,ll> ans = rec(K,1,len [K]);
	printf("%lld %lld\n",ans.first,ans.second);

	return 0;
}