description: Alice and Bob are playing a game on a matrix, consisting of 2 rows and m columns. The cell in the i-th row in the j-th column contains a_{i, j} coins in it.
  
  Initially, both Alice and Bob are standing in a cell (1, 1). They are going to perform a sequence of moves to reach a cell (2, m).
  
  The possible moves are: 
  
    * Move right — from some cell (x, y) to (x, y + 1); 
    * Move down — from some cell (x, y) to (x + 1, y). 
  
  
  
  First, Alice makes all her moves until she reaches (2, m). She collects the coins in all cells she visit (including the starting cell).
  
  When Alice finishes, Bob starts his journey. He also performs the moves to reach (2, m) and collects the coins in all cells that he visited, but Alice didn't.
  
  The score of the game is the total number of coins Bob collects.
  
  Alice wants to minimize the score. Bob wants to maximize the score. What will the score of the game be if both players play optimally?
  
  Input
  
  The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of testcases.
  
  Then the descriptions of t testcases follow.
  
  The first line of the testcase contains a single integer m (1 ≤ m ≤ 10^5) — the number of columns of the matrix.
  
  The i-th of the next 2 lines contain m integers a_{i,1}, a_{i,2}, ..., a_{i,m} (1 ≤ a_{i,j} ≤ 10^4) — the number of coins in the cell in the i-th row in the j-th column of the matrix.
  
  The sum of m over all testcases doesn't exceed 10^5.
  
  Output
  
  For each testcase print a single integer — the score of the game if both players play optimally.
  
  Example
  
  Input
  
  
  3
  3
  1 3 7
  3 5 1
  3
  1 3 9
  3 5 1
  1
  4
  7
  
  
  Output
  
  
  7
  8
  0
  
  Note
  
  The paths for the testcases are shown on the following pictures. Alice's path is depicted in red and Bob's path is depicted in blue.
  
  <image>
solution:     import java.io.*;
      import java.util.*;
      import java.math.*;
      import java.lang.*;
       
  
  
  
       //@Manan Parmar
      public class Solution2 implements Runnable {
          public void run() {
              
          InputReader sc = new InputReader(System.in);
          PrintWriter out = new PrintWriter(System.out);
          
          
          //code
          int t1=sc.nextInt();
          while(t1--!=0)
          {
              int n=sc.nextInt();
              int a[][]=new int[2][n];
              long x[]=new long[n],y[]=new long[n];
              for(int i=0;i<2;i++)
              {
                  long sum=0;
                  for(int j=0;j<n;j++)
                  {
                      a[i][j]=sc.nextInt();
                      if(i==1)
                      {
                          sum=sum+a[i][j];
                          y[j]=sum;
                      }
                  }
              }
              long sum=0;
              for(int i=n-1;i>=0;i--)
              {
                  sum=sum+a[0][i];
                  x[i]=sum;
              }
              long min=Integer.MAX_VALUE;
              if(n==1)
                  out.println("0");
              else
              {
                  for(int i=0;i<n;i++)
                  {
                      if(i==0)
                          min=Math.min(x[i+1],min);
                      else if(i==(n-1))
                          min=Math.min(y[i-1],min);
                      else
                      {
                          long x1=Math.max(x[i+1],y[i-1]);
                          min=Math.min(min,x1);
                      }
                  }
                  out.println(min);
              }
              /*for(int i=0;i<n;i++)
                  out.print(x[i]+" ");
              out.println();
              for(int i=0;i<n;i++)
                  out.print(y[i]+" ");
              out.println();*/
          }
  
          out.close();
          }
      /*
      class pairComparator implements Comparator<Pair>
          {
              public int compare(Pair p1,Pair p2)
              {
                  return p1.a-p2.a;
              }
          }
              class Pair{
              int id;
              int a;
  
              public Pair(int id,int a)
              {
                  this.id=id;
                  this.a=a;
              }   
          }
      */  
       
  
      //========================================================================
          
          boolean isPrime(int n) 
          { 
              // Corner case 
              if (n <= 1) 
                  return false; 
        
              // Check from 2 to n-1 
              for (int i = 2; i < n; i++) 
                  if (n % i == 0) 
                      return false; 
        
              return true; 
          } 
          int lcm(int number1, int number2) {
              if (number1 == 0 || number2 == 0) {
                  return 0;
              }
              int absNumber1 = Math.abs(number1);
              int absNumber2 = Math.abs(number2);
              int absHigherNumber = Math.max(absNumber1, absNumber2);
              int absLowerNumber = Math.min(absNumber1, absNumber2);
              int lcm = absHigherNumber;
              while (lcm % absLowerNumber != 0) {
                  lcm += absHigherNumber;
              }
              return lcm;
          }
          void quickSort(int a[],int l,int r)
          {
              if(l<r)
              {
                  int pindex=partition(a,l,r);
                  quickSort(a,l,pindex-1);
                  quickSort(a,pindex+1,r);
              }
  
          }
          int partition(int a[],int l,int r)
          {
              int pivot = a[r],pindex=l;
              for(int i=l;i<r;i++)
              {
                  if(a[i]<pivot)
                  {
                      int temp=a[i];
                      a[i]=a[pindex];
                      a[pindex]=temp;
                      pindex++;
                  }
              }
              int temp1=a[r];
              a[r]=a[pindex];
              a[pindex]=temp1;
              return pindex;
          }
          int binarySearch(int arr[], int x) 
          { 
              int l = 0, r = arr.length - 1; 
              while (l <= r) { 
                  int m = l + (r - l) / 2; 
        
                  // Check if x is present at mid 
                  if (arr[m] >= x)
                      if(m!=0&&arr[m-1]<x) 
                          return m;
                      else if(m==0)
                          return m; 
        
                  // If x greater, ignore left half 
                  if (arr[m] < x) 
                      l = m + 1; 
        
                  // If x is smaller, ignore right half 
                  else
                      r = m - 1; 
              } 
        
              // if we reach here, then element was 
              // not present 
              return -1; 
          } 
          boolean check(char a,char b)
          {
              if(a==b)
                  return true;
              else
                  return false;
          }
          long binarySearch(long arr[], long x) 
          { 
              int l = 0, r = arr.length - 1,q=0; 
              while (l<=r) { 
                  int m = l + (r - l) / 2; 
                  if (arr[l] >=x) 
                  {
                      q=1;
                      return l; 
                  }
                  if (arr[m] < x) 
                      l=m+1; 
                  else
                      r=m;
              } 
              return -1;
          }
  
          static class InputReader {
              private InputStream stream;
              private byte[] buf = new byte[1024];
              private int curChar;
              private int numChars;
              private SpaceCharFilter filter;
              private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
       
              public InputReader(InputStream stream) {
                  this.stream = stream;
              }
             
              public int read() {
                  if (numChars==-1)
                      throw new InputMismatchException();
                 
                  if (curChar >= numChars) {
                      curChar = 0;
                      try {
                          numChars = stream.read(buf);
                      }
                      catch (IOException e) {
                          throw new InputMismatchException();
                      }
                     
                      if(numChars <= 0)              
                          return -1;
                  }
                  return buf[curChar++];
              }
           
              public String nextLine() {
                  String str = "";
                  try {
                      str = br.readLine();
                  }
                  catch (IOException e) {
                      e.printStackTrace();
                  }
                  return str;
              }
              public int nextInt() {
                  int c = read();
                 
                  while(isSpaceChar(c))
                      c = read();
                 
                  int sgn = 1;
                 
                  if (c == '-') {
                      sgn = -1;
                      c = read();
                  }
                 
                  int res = 0;
                  do {
                      if(c<'0'||c>'9')
                          throw new InputMismatchException();
                      res *= 10;
                      res += c - '0';
                      c = read();
                  }
                  while (!isSpaceChar(c));
                 
                  return res * sgn;
              }
             
              public long nextLong() {
                  int c = read();
                  while (isSpaceChar(c))
                      c = read();
                  int sgn = 1;
                  if (c == '-') {
                      sgn = -1;
                      c = read();
                  }
                  long res = 0;
                 
                  do {
                      if (c < '0' || c > '9')
                          throw new InputMismatchException();
                      res *= 10;
                      res += c - '0';
                      c = read();
                  }
                  while (!isSpaceChar(c));
                      return res * sgn;
              }
             
              public double nextDouble() {
                  int c = read();
                  while (isSpaceChar(c))
                      c = read();
                  int sgn = 1;
                  if (c == '-') {
                      sgn = -1;
                      c = read();
                  }
                  double res = 0;
                  while (!isSpaceChar(c) && c != '.') {
                      if (c == 'e' || c == 'E')
                          return res * Math.pow(10, nextInt());
                      if (c < '0' || c > '9')
                          throw new InputMismatchException();
                      res *= 10;
                      res += c - '0';
                      c = read();
                  }
                  if (c == '.') {
                      c = read();
                      double m = 1;
                      while (!isSpaceChar(c)) {
                          if (c == 'e' || c == 'E')
                              return res * Math.pow(10, nextInt());
                          if (c < '0' || c > '9')
                              throw new InputMismatchException();
                          m /= 10;
                          res += (c - '0') * m;
                          c = read();
                      }
                  }
                  return res * sgn;
              }
             
              public String readString() {
                  int c = read();
                  while (isSpaceChar(c))
                      c = read();
                  StringBuilder res = new StringBuilder();
                  do {
                      res.appendCodePoint(c);
                      c = read();
                  }
                  while (!isSpaceChar(c));
                 
                  return res.toString();
              }
           
              public boolean isSpaceChar(int c) {
                  if (filter != null)
                      return filter.isSpaceChar(c);
                  return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
              }
           
              public String next() {
                  return readString();
              }
             
              public interface SpaceCharFilter {
                  public boolean isSpaceChar(int ch);
              }
          }
  
          public static void main(String args[]) throws Exception {
              new Thread(null, new Solution2(),"Main",1<<27).start();
          }
      }
  