#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

ll k,l,r;

ll lensum[125];
ll wasum[125];
ll sekisum[125];
string val[125];

string tos(ll v){
  string ret = "";
  while(v){
    ret = (char)(v%10 + '0') + ret;
    v/=10;
  }
  return ret;
}

inline pll merge(const pll &a, const pll &b){
  return pll(a.first+b.first,a.second*b.second%MOD);
}

pll dfs(int level, ll lft){
  if(l<=lft && lft+lensum[level]<=r){
    pll ret = pll(wasum[level],sekisum[level]);
    return ret;
  }else if(r<=lft || lft+lensum[level]<=l){
    pll ret = pll(0,1);
    return ret;
  }
  pll ret(0,1);
  ret = merge(ret,dfs(level-1,lft));
  lft += lensum[level-1];
  REP(i,val[level].size()){
    if(l<=lft+i && lft+i<r){
      int yo = val[level][i]-'0';
      if(yo==0)yo=10;
      ret = merge(ret,pll(yo,yo));
    }
  }
  lft += val[level].size();
  ret = merge(ret,dfs(level-1,lft));
  return ret;
}

pll naive(){
  string s;
  FOR(i,1,k+1){
    string a = tos(i*i);
    s = s + a + s;
  }
  ll wa = 0, seki = 1;
  FOR(i,l,r){
    int v = s[i]-'0';
    if(v==0)v=10;
    wa += v;
    seki = seki*v%MOD;
  }
  return pll(wa,seki);
}

uint32_t xorshift(void) {
  static uint32_t x = 123456789;
  static uint32_t y = 362436069;
  static uint32_t z = 521288629;
  uint32_t t;

  t = (x ^ (x << 3)) ^ (y ^ (y >> 19)) ^ (z ^ (z << 6));
  x = y; y = z;
  return z = t;
}

int main(){
  cin>>k>>l>>r;
  lensum[0] = 0;
  wasum[0] = 0;
  sekisum[0] = 1;
  val[0] = "";
  FOR(i,1,k+1){
    ll v = i*i;
    val[i] = tos(v);
    lensum[i] = 2*lensum[i-1] + val[i].size();
    wasum[i] = 2*wasum[i-1];
    sekisum[i] = sekisum[i-1]*sekisum[i-1]%MOD;
    REP(j,val[i].size()){
      int yo = val[i][j]-'0';
      if(yo==0)yo=10;
      wasum[i] = wasum[i]+yo;
      sekisum[i] = sekisum[i]*yo%MOD;
    }
    if(lensum[i]>=r){
      k = i;
      break;
    }
  }
  if(lensum[k]<r){
    puts("-1");
    return 0;
  }
  --l;
  // DEBUG(lensum[k]);
  // while(true){
  //   int len = lensum[k];
  //   while(true){
  //     l = xorshift()%len;
  //     r = xorshift()%len;r++;
  //     if(l<r)break;
  //   }
  //   pll ans = dfs(k,0);
  //   pll yo = naive();
  //   if(ans!=yo){
  //     DEBUG(ans.first);
  //     DEBUG(ans.second);
  //     DEBUG(yo.first);
  //     DEBUG(yo.second);
  //     DEBUG(k);
  //     DEBUG(l);
  //     DEBUG(r);
  //     break;
  //   }
  // }
  pll ans = dfs(k,0);
  printf("%lld %lld\n",ans.first,ans.second);
  return 0;
}