using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static long[] NList => ReadLine().Split().Select(long.Parse).ToArray(); public static void Main() { Solve(); } static void Solve() { var c = NList; var (k, l, r) = (c[0], c[1], c[2]); var ans = LongStr(k, l, r); if (ans.sum >= 0) WriteLine($"{ans.sum} {ans.mul}"); else WriteLine(-1); } static (long sum, long mul) LongStr(long k, long l, long r) { var len = new List<(long len, long[] count)>() { (0, new long[10]) }; for (var i = 1; i <= k; ++i) { var n2 = (i * i).ToString(); var nlen = len[^1].len * 2 + n2.Length; var ncount = new long[10]; for (var b = 0; b < 10; ++b) ncount[b] = len[^1].count[b] * 2; foreach (var ni in n2) ++ncount[ni - '0']; len.Add((nlen, ncount)); if (nlen >= r) break; } if (len[^1].len < r) { return (-1, -1); } var (sumr, mulr) = Calc(len, r); var (suml, mull) = Calc(len, l - 1); return (sumr - suml, mulr * Exp(mull, mod - 2) % mod); } static int mod = 1_000_000_007; static (long sum, long mul) Calc(List<(long len, long[] count)> len, long r) { var count = new long[10]; var cur = len.Count - 1; while (r > 0) { if (len[cur - 1].len > r) { --cur; continue; } var n2 = (cur * cur).ToString(); for (var b = 0; b < 10; ++b) count[b] += len[cur - 1].count[b]; for (var i = 0; i < r - len[cur - 1].len && i < n2.Length; ++i) ++count[n2[i] - '0']; r -= len[cur - 1].len + n2.Length; --cur; } var sum = count[0] * 10; var mul = Exp(10, count[0]); for (var b = 1; b < 10; ++b) { sum += count[b] * b; mul = mul * Exp(b, count[b]) % mod; } return (sum, mul); } static long Exp(long n, long p) { long _n = n % mod; var _p = p; var result = 1L; if ((_p & 1) == 1) result *= _n; while (_p > 0) { _n = _n * _n % mod; _p >>= 1; if ((_p & 1) == 1) result = result * _n % mod; } return result; } }