description: On a circle lie 2n distinct points, with the following property: however you choose 3 chords that connect 3 disjoint pairs of points, no point strictly inside the circle belongs to all 3 chords. The points are numbered 1,   2,   ...,   2n in clockwise order.
  
  Initially, k chords connect k pairs of points, in such a way that all the 2k endpoints of these chords are distinct.
  
  You want to draw n - k additional chords that connect the remaining 2(n - k) points (each point must be an endpoint of exactly one chord).
  
  In the end, let x be the total number of intersections among all n chords. Compute the maximum value that x can attain if you choose the n - k chords optimally.
  
  Note that the exact position of the 2n points is not relevant, as long as the property stated in the first paragraph holds.
  
  Input
  
  The first line contains a single integer t (1 ≤ t ≤ 100) — the number of test cases. Then t test cases follow.
  
  The first line of each test case contains two integers n and k (1 ≤ n ≤ 100, 0 ≤ k ≤ n) — half the number of points and the number of chords initially drawn.
  
  Then k lines follow. The i-th of them contains two integers x_i and y_i (1 ≤ x_i,   y_i ≤ 2n, x_i ≠ y_i) — the endpoints of the i-th chord. It is guaranteed that the 2k numbers x_1,   y_1,   x_2,   y_2,   ...,   x_k,   y_k are all distinct.
  
  Output
  
  For each test case, output the maximum number of intersections that can be obtained by drawing n - k additional chords.
  
  Example
  
  Input
  
  
  4
  4 2
  8 2
  1 5
  1 1
  2 1
  2 0
  10 6
  14 6
  2 20
  9 10
  13 18
  15 12
  11 7
  
  
  Output
  
  
  4
  0
  1
  14
  
  Note
  
  In the first test case, there are three ways to draw the 2 additional chords, shown below (black chords are the ones initially drawn, while red chords are the new ones):
  
  <image>
  
  We see that the third way gives the maximum number of intersections, namely 4.
  
  In the second test case, there are no more chords to draw. Of course, with only one chord present there are no intersections.
  
  In the third test case, we can make at most one intersection by drawing chords 1-3 and 2-4, as shown below:
  
  <image>
solution: /**
   * Created by Himanshu
   **/
  
  import java.util.*;
  import java.io.*;
  import java.math.*;
  
  public class C1552 {
      public static void main(String[] args) throws IOException {
          PrintWriter out = new PrintWriter(System.out);
          Reader s = new Reader();
          int t = s.i();
          while (t-- > 0) {
              int n = s.i() , k = s.i();
              int [][] arr = new int[n][2];
              HashSet<Integer> set = new HashSet<>();
              int count = 0;
              for (int i=0;i<k;i++) {
                  int a = s.i(), b = s.i();
                  arr[i][0] = Math.min(a,b);
                  arr[i][1] = Math.max(a,b);
                  for (int j=0;j<i;j++) {
                      if ((arr[j][0] > arr[i][0] && arr[j][0] < arr[i][1] && arr[j][1] > arr[i][1]) ||
                              (arr[j][0] < arr[i][0] && arr[j][1] > arr[i][0] && arr[j][1] < arr[i][1])) {
                          count ++;
                      }
                  }
                  set.add(arr[i][0]);
                  set.add(arr[i][1]);
              }
              ArrayList<Integer> list = new ArrayList<>();
              for (int i=1;i<=2*n;i++) {
                  if (!set.contains(i)) list.add(i);
              }
              int m = list.size();
              int in = k;
              for (int i=0;i<m/2;i++) {
                  int a = list.get(i);
                  int b = list.get(i+m/2);
                  arr[in][0] = a;
                  arr[in][1] = b;
                  for (int j=0;j<in;j++) {
                      if ((arr[j][0] > arr[in][0] && arr[j][0] < arr[in][1] && arr[j][1] > arr[in][1]) ||
                              (arr[j][0] < arr[in][0] && arr[j][1] > arr[in][0] && arr[j][1] < arr[in][1])) {
                          count ++;
                      }
                  }
                  in++;
              }
              out.println(count);
          }
          out.flush();
      }
  
      public static void shuffle(long[] arr) {
          int n = arr.length;
          Random rand = new Random();
          for (int i = 0; i < n; i++) {
              long temp = arr[i];
              int randomPos = i + rand.nextInt(n - i);
              arr[i] = arr[randomPos];
              arr[randomPos] = temp;
          }
      }
  
      private static long phi(long n) {
          long result = n;
          for (long i = 2; i * i <= n; i++) {
              if (n % i == 0) {
                  while (n % i == 0)
                      n /= i;
                  result -= result / i;
              }
          }
          if (n > 1)
              result -= result / n;
          return result;
      }
  
      private static int gcd(int a, int b) {
          if(b == 0) return a;
          return gcd(b,a%b);
      }
  
      public static long nCr(long[] fact, long[] inv, int n, int r, long mod) {
          if (n < r)
              return 0;
          return ((fact[n] * inv[n - r]) % mod * inv[r]) % mod;
      }
  
      private static void factorials(long[] fact, long[] inv, long mod, int n) {
          fact[0] = 1;
          inv[0] = 1;
          for (int i = 1; i <= n; ++i) {
              fact[i] = (fact[i - 1] * i) % mod;
              inv[i] = power(fact[i], mod - 2, mod);
          }
      }
  
      private static long power(long a, long n, long p) {
          long result = 1;
          while (n > 0) {
              if (n % 2 == 0) {
                  a = (a * a) % p;
                  n /= 2;
              } else {
                  result = (result * a) % p;
                  n--;
              }
          }
          return result;
      }
  
      private static long power(long a, long n) {
          long result = 1;
          while (n > 0) {
              if (n % 2 == 0) {
                  a = (a * a);
                  n /= 2;
              } else {
                  result = (result * a);
                  n--;
              }
          }
          return result;
      }
  
      private static long query(long[] tree, int in, int start, int end, int l, int r) {
          if (start >= l && r >= end) return tree[in];
          if (end < l || start > r) return 0;
          int mid = (start + end) / 2;
          long x = query(tree, 2 * in, start, mid, l, r);
          long y = query(tree, 2 * in + 1, mid + 1, end, l, r);
          return x + y;
      }
  
      private static void update(int[] arr, long[] tree, int in, int start, int end, int idx, int val) {
          if (start == end) {
              tree[in] = val;
              arr[idx] = val;
              return;
          }
          int mid = (start + end) / 2;
          if (idx > mid) update(arr, tree, 2 * in + 1, mid + 1, end, idx, val);
          else update(arr, tree, 2 * in, start, mid, idx, val);
          tree[in] = tree[2 * in] + tree[2 * in + 1];
      }
  
      private static void build(int[] arr, long[] tree, int in, int start, int end) {
          if (start == end) {
              tree[in] = arr[start];
              return;
          }
          int mid = (start + end) / 2;
          build(arr, tree, 2 * in, start, mid);
          build(arr, tree, 2 * in + 1, mid + 1, end);
          tree[in] = (tree[2 * in + 1] + tree[2 * in]);
      }
  
      static class Reader {
          private InputStream mIs;
          private byte[] buf = new byte[1024];
          private int curChar, numChars;
  
          public Reader() {
              this(System.in);
          }
  
          public Reader(InputStream is) {
              mIs = is;
          }
  
          public int read() {
              if (numChars == -1) throw new InputMismatchException();
              if (curChar >= numChars) {
                  curChar = 0;
                  try {
                      numChars = mIs.read(buf);
                  } catch (IOException e) {
                      throw new InputMismatchException();
                  }
                  if (numChars <= 0) return -1;
              }
              return buf[curChar++];
          }
  
          public String nextLine() {
              int c = read();
              while (isSpaceChar(c)) c = read();
              StringBuilder res = new StringBuilder();
              do {
                  res.appendCodePoint(c);
                  c = read();
              } while (!isEndOfLine(c));
              return res.toString();
          }
  
          public String s() {
              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 long l() {
              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 int i() {
              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 double d() throws IOException {
              return Double.parseDouble(s());
          }
  
          public boolean isSpaceChar(int c) {
              return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
          }
  
          public boolean isEndOfLine(int c) {
              return c == '\n' || c == '\r' || c == -1;
          }
  
          public int[] arr(int n) {
              int[] ret = new int[n];
              for (int i = 0; i < n; i++) {
                  ret[i] = i();
              }
              return ret;
          }
  
          public long[] arrLong(int n) {
              long[] ret = new long[n];
              for (int i = 0; i < n; i++) {
                  ret[i] = l();
              }
              return ret;
          }
      }
  //    static class pairLong implements Comparator<pairLong> {
  //        long first, second;
  //
  //        pairLong() {
  //        }
  //
  //        pairLong(long first, long second) {
  //            this.first = first;
  //            this.second = second;
  //        }
  //
  //        @Override
  //        public int compare(pairLong p1, pairLong p2) {
  //            if (p1.first == p2.first) {
  //                if(p1.second > p2.second) return 1;
  //                else return -1;
  //            }
  //            if(p1.first > p2.first) return 1;
  //            else return -1;
  //        }
  //    }
  //    static class pair implements Comparator<pair> {
  //        int first, second;
  //
  //        pair() {
  //        }
  //
  //        pair(int first, int second) {
  //            this.first = first;
  //            this.second = second;
  //        }
  //
  //        @Override
  //        public int compare(pair p1, pair p2) {
  //            if (p1.first == p2.first) return p1.second - p2.second;
  //            return p1.first - p2.first;
  //        }
  //    }
  }
  
  