package contest200828; 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 = ""; void solve() { int n = ni(), m = ni(); int[] a = na(n); int[] b = na(m); // sum_i sum_j sum_{k=1}^b[j] 2[a[i]*k/b[j]] long s = 0; for(int v : a){ for(int w : b){ s += sumFloorFraction(v, w, w+1); } } s = s % mod * 2 % mod; if(s < 0)s += mod; out.println(s); } public static long gcd(long a, long b) { while (b > 0) { long c = a; a = b; b = c % b; } return a; } static int mod = 1000000007; public static long sumFloorFraction(long a, long b, long n) { if(b == 0)throw new ArithmeticException(); if(a == 0 || n == 0)return 0L; // gcd(a,b)=1 long g = gcd(a, b); a /= g; b /= g; long S = 0; int h = 0; while(a != 0 && n != 0){ if(a >= b){ S += a/b%mod*(n*(n-1)/2%mod); S %= mod; a %= b; if(a == 0)break; } if(n >= b){ S += ((n/b)*(n/b-1)/2%mod)*a%mod*b + (a-1)*(b-1)/2%mod*(n/b) + (n/b)*a%mod*(n%b); // under_block + diagonal_block + last_under_block S %= mod; n %= b; if(n == 0)break; } // TODO S += (b-1)*(a-1)/2-(b-n)*(a*(n-1)/b%mod); // all-rectangle S %= mod; n = a-a*(n-1)/b; long d = a; a = b; b = d; S = -S; // flipped from then on h++; } return h % 2 == 0 ? S : -S; } 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)); } }