#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll;
const int N = 61;
const int mod = 1e9 + 7;
ll k, l, r;
ll len[N], sum[N], prod[N];
inline int fix(int d)
{
    return d == 0 ? 10 : d;
}
inline ll query_sum(ll L, ll R, ll l, ll r, int k)
{
    ll ans = 0;
    if (l <= L && R <= r)
        return sum[k];
    if (l <= L + len[k - 1] - 1)
        ans = ans + query_sum(L, L + len[k - 1] - 1, l, r, k - 1);
    int sq = k * k, lg = log10(sq) + 1;
    for (int i = lg - 1; i >= 0; i--)
    {
        if (r >= L + len[k - 1] + i && l <= L + len[k - 1] + i)
            ans += fix(sq % 10);
        sq /= 10;
    }
    if (r >= R - len[k - 1] + 1)
        ans = ans + query_sum(R - len[k - 1] + 1, R, l, r, k - 1);
    return ans;
}
inline ll query_prod(ll L, ll R, ll l, ll r, int k)
{
    ll ans = 1;
    if (l <= L && R <= r)
        return prod[k];
    if (l <= L + len[k - 1] - 1)
        ans = ans * query_prod(L, L + len[k - 1] - 1, l, r, k - 1) % mod;
    int sq = k * k, lg = log10(sq) + 1;
    for (int i = lg - 1; i >= 0; i--)
    {
        if (r >= L + len[k - 1] + i && l <= L + len[k - 1] + i)
            ans = ans * fix(sq % 10) % mod;
        sq /= 10;
    }
    if (r >= R - len[k - 1] + 1)
        ans = ans * query_prod(R - len[k - 1] + 1, R, l, r, k - 1) % mod;
    return ans;
}
inline int digit_sum(int x)
{
    int sum = 0;
    while (x)
    {
        sum += fix(x % 10);
        x /= 10;
    }
    return sum;
}
inline ll digit_prod(int x)
{
    ll sum = 1;
    while (x)
    {
        sum = sum * fix(x % 10) % mod;
        x /= 10;
    }
    return sum;
}
int main(int argc, char const *argv[])
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    cin >> k >> l >> r, prod[0] = 1;
    for (int i = 1; i <= 60; i++)
    {
        int sq = i * i, l = log10(sq) + 1;
        len[i] = len[i - 1] * 2 + l;
        sum[i] = 2 * sum[i - 1] + digit_sum(sq);
        prod[i] = prod[i - 1] * prod[i - 1] % mod * digit_prod(sq) % mod;
    }
    k = min(k, 60ll);
    if (len[k] < r)
    {
        cout << -1 << endl;
        return 0;
    }
    cout << query_sum(1, len[k], l, r, k) << " ";
    cout << query_prod(1, len[k], l, r, k) << endl;
    return 0;
}