package contest; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.InputMismatchException; import java.util.List; public class Q940_2 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { for(int T = ni();T > 0;T--){ if(!(T <= 100))throw new AssertionError(); int L = ni(); if(!(1 <= L))throw new AssertionError(); if(!(L <= 1000000000))throw new AssertionError(); int[] a = na(9); for(int i = 0;i < 9;i++){ if(!(0 <= a[i]))throw new AssertionError(); if(!(a[i] <= 1000000000))throw new AssertionError(); } int[][] inds = { {0,1,2},{3,4,5},{6,7,8}, {0,3,6},{1,4,7},{2,5,8}, {0,4,8},{2,4,6} }; List st = new ArrayList<>(); st.add(L/2); st.add(L/2+1); st.add(1); st.add(L); for(int i = 0;i < 9;i++){ if(a[i] != 0){ st.add(a[i]); st.add(a[i]+1); st.add(L-a[i]); st.add(L-a[i]+1); } } int[] pos = new int[2]; int p = 0; for(int i = 0;i < 9;i++){ if(a[i] == 0){ pos[p++] = i; } } if(!(p == 2))throw new AssertionError(); Collections.sort(st); int ret = 0; outer: for(int u = 0;u < st.size()-1;u++){ a[pos[0]] = st.get(u); a[pos[1]] = L-st.get(u); for(int[] ind : inds){ if(!ok(a[ind[0]], a[ind[1]], a[ind[2]])){ continue outer; } } ret += st.get(u+1)-st.get(u); } out.println(ret); } } boolean ok(int a, int b, int c){ // { return a > 0 && b > 0 && c > 0 && a != b && b != c && c != a && (a < b && b > c || a > b && b < c); } 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"); } public static void main(String[] args) throws Exception { new Q940_2().run(); } private byte[] inbuf = new byte[1024]; private 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 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[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, 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 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)); } }