#include <iostream>
#include <vector>
#include <sstream>
#include <functional>
#include <cassert>
#define repeat(i,n) for (int i = 0; (i) < int(n); ++(i))
#define repeat_from(i,m,n) for (int i = (m); (i) < int(n); ++(i))
using ll = long long;
using namespace std;
template <class T> inline void setmin(T & a, T const & b) { a = min(a, b); }

ll powmod(ll x, ll y, ll p) { // O(log y)
    assert (y >= 0);
    x %= p; if (x < 0) x += p;
    ll z = 1;
    for (ll i = 1; i <= y; i <<= 1) {
        if (y & i) z = z * x % p;
        x = x * x % p;
    }
    return z;
}
ll inv(ll x, ll p) { // p must be a prime, O(log p)
    assert ((x % p + p) % p != 0);
    return powmod(x, p-2, p);
}

constexpr int mod = 1e9+7;
pair<ll, int> from_string(string const & s) {
    ll sum = 0;
    int prod = 1;
    for (char c : s) {
        int d = (c == '0' ? 10 : c - '0');
        sum += d;
        prod = prod *(ll) d % mod;
    }
    return { sum, prod };
}
pair<ll, int> addmul(pair<ll, int> a, pair<ll, int> b) {
    return { a.first + b.first, a.second *(ll) b.second % mod };
}
int main() {
    int k; ll l, r; cin >> k >> l >> r; -- l;
    vector<string> str { "" };
    vector<ll> width { 0 };
    vector<ll> sums { 0 };
    vector<int> prods { 1 };
    repeat_from (i,1,k+1) {
        ostringstream oss;
        oss << i*i;
        string s = oss.str();
        str.push_back(s);
        width.push_back(2 * width.back() + s.length());
        ll sum = 2 * sums.back();
        int prod = prods.back() *(ll) prods.back() % mod;
        tie(sum, prod) = addmul(make_pair(sum, prod), from_string(s));
        sums.push_back(sum);
        prods.push_back(prod);
        if (r <= width.back()) break;
    }
    function<pair<ll, int> (int, ll)> func = [&](int i, ll r) {
        if (i == 0) {
            return make_pair(0ll, 1);
        } else if (r < width[i-1]) {
            return func(i-1, r);
        } else if (r == width[i-1]) {
            return make_pair(sums[i-1], prods[i-1]);
        } else if (r < width[i-1] + str[i].length()) {
            ll sum = sums[i-1];
            int prod = prods[i-1];
            string s = str[i].substr(0, r - width[i-1]);
            return addmul(make_pair(sum, prod), from_string(s));
        } else {
            assert (r < width[i-1] + str[i].length() + width[i-1]);
            ll sum = sums[i-1];
            int prod = prods[i-1];
            string s = str[i];
            ll nr = r - width[i-1] - s.length();
            return addmul(addmul(make_pair(sum, prod), from_string(s)), func(i-1, nr));
        }
    };
    if (width.back() < r) {
        cout << -1 << endl;
    } else {
        ll lsum; int lprod; tie(lsum, lprod) = func(width.size(), l);
        ll rsum; int rprod; tie(rsum, rprod) = func(width.size(), r);
        cout << (rsum - lsum) << ' ' << (rprod *(ll) inv(lprod, mod) % mod) << endl;
    }
    return 0;
}