package contest170310; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class D { InputStream is; PrintWriter out; String INPUT = ""; long[] len = new long[61]; int[] llen = new int[61]; long[] sum = new long[61]; long[] prod = new long[61]; int mod = 1000000007; void solve() { int K = ni(); long L = nl(), R = nl(); len[1] = 1; sum[1] = 1; prod[1] = 1; llen[1] = 1; for(int i = 2;i <= 60;i++){ llen[i] = Long.toString(i*i).length(); len[i] = llen[i] + len[i-1] * 2; sum[i] = sum[i-1] * 2; prod[i] = prod[i-1] * prod[i-1] % mod; for(int j = i*i;j > 0;j /= 10){ int v = j % 10 == 0 ? 10 : j % 10; sum[i] += v; prod[i] = prod[i] * v % mod; } sum[i] %= mod; } if(K <= 60 && R > len[K]){ out.println(-1); return; } out.print(sum(R, 60) - sum(L-1, 60) + " "); out.println(mul(R, 60)* invl(mul(L-1, 60), mod) % mod); } public static long invl(long a, long mod) { long b = mod; long p = 1, q = 0; while (b > 0) { long c = a / b; long d; d = a; a = b; b = d % b; d = p; p = q; q = d - c * q; } return p < 0 ? p + mod : p; } long sum(long n, int zone) { if(n <= 0)return 0L; if(zone == 1)return 1L; if(n <= len[zone-1]){ return sum(n, zone-1); }else if(n <= len[zone-1] + llen[zone]){ long ret = sum[zone-1]; long rem = n - len[zone-1]; char[] s = Long.toString(zone*zone).toCharArray(); for(int i = 0;i < rem;i++){ int v = s[i] == '0' ? 10 : s[i]-'0'; ret += v; } return ret; }else{ long ret = sum[zone-1]; char[] s = Long.toString(zone*zone).toCharArray(); for(int i = 0;i < s.length;i++){ int v = s[i] == '0' ? 10 : s[i]-'0'; ret += v; } return (ret + sum(n-len[zone-1] - llen[zone], zone-1)); } } long mul(long n, int zone) { if(n <= 0)return 1L; if(zone == 1)return 1L; if(n <= len[zone-1]){ return mul(n, zone-1); }else if(n <= len[zone-1] + llen[zone]){ long ret = prod[zone-1]; long rem = n - len[zone-1]; char[] s = Long.toString(zone*zone).toCharArray(); for(int i = 0;i < rem;i++){ int v = s[i] == '0' ? 10 : s[i]-'0'; ret = ret * v % mod; } return ret; }else{ long ret = prod[zone-1]; char[] s = Long.toString(zone*zone).toCharArray(); for(int i = 0;i < s.length;i++){ int v = s[i] == '0' ? 10 : s[i]-'0'; ret = ret * v % mod; } return (ret * mul(n-len[zone-1] - llen[zone], zone-1)) % mod; } } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new D().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }