description: You have an array a consisting of n distinct positive integers, numbered from 1 to n. Define p_k as $$$p_k = ∑_{1 ≤ i, j ≤ k} a_i mod a_j, where x \bmod y denotes the remainder when x is divided by y. You have to find and print p_1, p_2, \ldots, p_n$$$. 
  
  Input
  
  The first line contains n — the length of the array (2 ≤ n ≤ 2 ⋅ 10^5).
  
  The second line contains n space-separated distinct integers a_1, …, a_n (1 ≤ a_i ≤ 3 ⋅ 10^5, a_i ≠ a_j if i ≠ j). 
  
  Output
  
  Print n integers p_1, p_2, …, p_n. 
  
  Examples
  
  Input
  
  
  4
  6 2 7 3
  
  
  Output
  
  
  0 2 12 22
  
  
  Input
  
  
  3
  3 2 1
  
  
  Output
  
  
  0 3 5
solution: import java.util.*;
  import java.io.*;
  import java.text.*;
  
  public class CF_1553_F{
      //SOLUTION BEGIN
      void pre() throws Exception{}
      void solve(int TC) throws Exception{
          int N = ni(), MX = (int)3e5+1;
          FenwickTree cnt = new FenwickTree(MX), sum = new FenwickTree(MX);
          FenwickTree upd = new FenwickTree(MX);
          long ans = 0;
          for(long i = 0; i< N; i++){
              int J = ni();
              long curSum = 0, curCnt = 0;
              for(int j = 0; j< MX; j += J){
                  long nxtSum = sum.sum(j+J-1), nxtCnt = cnt.sum(j+J-1);
                  ans += (nxtSum-curSum) - (nxtCnt-curCnt)*(long)j;
                  curSum = nxtSum;
                  curCnt = nxtCnt;
              }
  
              ans += i*J + upd.sum(J);
              for(int j = J; j < MX; j += J)
                  upd.add(j, -J);
  
              cnt.add(J, 1);
              sum.add(J, J);
              p(ans);
          }
          pn("");
      }
      class FenwickTree {
          long[] bit;
          int N;
          //uses 0-based indexing
          public FenwickTree(int N){
              this.N = N;
              bit = new long[N];
          }
          void add(int idx, long delta){
              for (; idx < N; idx = idx | (idx + 1))
                  bit[idx] += delta;
          }
          long sum(int r){
              if(r >= N)r = N-1;
              long ret = 0;
              for (; r >= 0; r = (r & (r + 1)) - 1)
                  ret += bit[r];
              return ret;
          }
          long query(int l, int r){
              if(l < 0)l = 0;
              if(r >= N)r = N-1;
              if(l > r)return 0;
              return sum(r)-sum(l-1);}
      }
      //SOLUTION END
      void hold(boolean b)throws Exception{if(!b)throw new Exception("Hold right there, Sparky!");}
      void exit(boolean b){if(!b)System.exit(0);}
      static void dbg(Object... o){System.err.println(Arrays.deepToString(o));}
      final long IINF = (long)1e17;
      final int INF = (int)1e9+2;
      DecimalFormat df = new DecimalFormat("0.00000000000");
      double PI = 3.141592653589793238462643383279502884197169399, eps = 1e-8;
      static boolean multipleTC = false, memory = true, fileIO = false;
      FastReader in;PrintWriter out;
      void run() throws Exception{
          long ct = System.currentTimeMillis();
          if (fileIO) {
              in = new FastReader("");
              out = new PrintWriter("");
          } else {
              in = new FastReader();
              out = new PrintWriter(System.out);
          }
          //Solution Credits: Taranpreet Singh
          int T = multipleTC? ni():1;
          pre();
          for (int t = 1; t <= T; t++) solve(t);
          out.flush();
          out.close();
          System.err.println(System.currentTimeMillis() - ct);
      }
      public static void main(String[] args) throws Exception{
          if(memory)new Thread(null, new Runnable() {public void run(){try{new CF_1553_F().run();}catch(Exception e){e.printStackTrace();System.exit(1);}}}, "1", 1 << 28).start();
          else new CF_1553_F().run();
      }
      int[][] make(int n, int e, int[] from, int[] to, boolean f){
          int[][] g = new int[n][];int[]cnt = new int[n];
          for(int i = 0; i< e; i++){
              cnt[from[i]]++;
              if(f)cnt[to[i]]++;
          }
          for(int i = 0; i< n; i++)g[i] = new int[cnt[i]];
          for(int i = 0; i< e; i++){
              g[from[i]][--cnt[from[i]]] = to[i];
              if(f)g[to[i]][--cnt[to[i]]] = from[i];
          }
          return g;
      }
      int[][][] makeS(int n, int e, int[] from, int[] to, boolean f){
          int[][][] g = new int[n][][];int[]cnt = new int[n];
          for(int i = 0; i< e; i++){
              cnt[from[i]]++;
              if(f)cnt[to[i]]++;
          }
          for(int i = 0; i< n; i++)g[i] = new int[cnt[i]][];
          for(int i = 0; i< e; i++){
              g[from[i]][--cnt[from[i]]] = new int[]{to[i], i, 0};
              if(f)g[to[i]][--cnt[to[i]]] = new int[]{from[i], i, 1};
          }
          return g;
      }
      int find(int[] set, int u){return set[u] = (set[u] == u?u:find(set, set[u]));}
      int digit(long s){int ans = 0;while(s>0){s/=10;ans++;}return ans;}
      long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}
      int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}
      int bit(long n){return (n==0)?0:(1+bit(n&(n-1)));}
      void p(Object... o){for(Object oo:o)out.print(oo+" ");}
      void pn(Object... o){for(int i = 0; i< o.length; i++)out.print(o[i]+(i+1 < o.length?" ":"\n"));}
      void pni(Object... o){for(Object oo:o)out.print(oo+" ");out.println();out.flush();}
      String n()throws Exception{return in.next();}
      String nln()throws Exception{return in.nextLine();}
      int ni()throws Exception{return Integer.parseInt(in.next());}
      long nl()throws Exception{return Long.parseLong(in.next());}
      double nd()throws Exception{return Double.parseDouble(in.next());}
  
      class FastReader{
          BufferedReader br;
          StringTokenizer st;
          public FastReader(){
              br = new BufferedReader(new InputStreamReader(System.in));
          }
  
          public FastReader(String s) throws Exception{
              br = new BufferedReader(new FileReader(s));
          }
  
          String next() throws Exception{
              while (st == null || !st.hasMoreElements()){
                  try{
                      st = new StringTokenizer(br.readLine());
                  }catch (IOException  e){
                      throw new Exception(e.toString());
                  }
              }
              return st.nextToken();
          }
  
          String nextLine() throws Exception{
              String str;
              try{
                  str = br.readLine();
              }catch (IOException e){
                  throw new Exception(e.toString());
              }
              return str;
          }
      }
  }