Problem: This is the hard version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make hacks only if you solve all versions of this task.

You are given a string s, consisting of lowercase English letters. Find the longest string, t, which satisfies the following conditions: 

  * The length of t does not exceed the length of s. 
  * t is a palindrome. 
  * There exists two strings a and b (possibly empty), such that t = a + b ( "+" represents concatenation), and a is prefix of s while b is suffix of s. 

Input

The input consists of multiple test cases. The first line contains a single integer t (1 ≤ t ≤ 10^5), the number of test cases. The next t lines each describe a test case.

Each test case is a non-empty string s, consisting of lowercase English letters.

It is guaranteed that the sum of lengths of strings over all test cases does not exceed 10^6.

Output

For each test case, print the longest string which satisfies the conditions described above. If there exists multiple possible solutions, print any of them.

Example

Input


5
a
abcdfdcecba
abbaxyzyx
codeforces
acbba


Output


a
abcdfdcba
xyzyx
c
abba

Note

In the first test, the string s = "a" satisfies all conditions.

In the second test, the string "abcdfdcba" satisfies all conditions, because:

  * Its length is 9, which does not exceed the length of the string s, which equals 11. 
  * It is a palindrome. 
  * "abcdfdcba" = "abcdfdc" + "ba", and "abcdfdc" is a prefix of s while "ba" is a suffix of s. 



It can be proven that there does not exist a longer string which satisfies the conditions.

In the fourth test, the string "c" is correct, because "c" = "c" + "" and a or b can be empty. The other possible solution for this test is "s".

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
public class D1 {
	
	BufferedReader in;
	StringTokenizer st;

	public static void main(String[] args) throws IOException {
		new D1().run();
	}

	public void run() throws IOException {
		in = new BufferedReader(new InputStreamReader(System.in));
		int t = ni();
		while(t-->0)
			solve();
	}

	void solve() throws IOException {
		String s = nextToken();
		int n = s.length();

		int i=0 , j = n-1;
		while( i<j && s.charAt(i) == s.charAt(j) ) {
			++i;
			j--;
		}

		if( i == j ) {
			System.out.println(s);
			return;
		}

		String remaining = s.substring(i , j+1);
		String revRemaining = new StringBuilder( remaining ).reverse().toString();

		int prefixLen = longest( remaining , revRemaining ); 
		int suffixLen = longest( revRemaining , remaining );

		if( prefixLen > suffixLen ) {
			String ans = s.substring( 0 , i+prefixLen) +  s.substring(j+1);
			System.out.println( ans );
		} else {
			String ans = s.substring( 0 , i) +  s.substring( j+1-suffixLen );
			System.out.println( ans );
		}

	}

	int longest( String a , String b ) {
		char s[] = new String(a+"#"+b).toCharArray();
		int lps[] = new int[s.length];
		lps[0] = 0;

		for(int i=1 ; i<s.length ; i++) {

			int prevlen = lps[i-1];

			//len prefix = len suffix
			// i need to check for 0...len-1
			// observation is both suffix in current prefix and suffix match
			// so i need to find max prefix which is a suffix in len only
			while( prevlen>0 && s[prevlen] != s[i] ) {
				prevlen = lps[prevlen-1];
			}


			//prevLen is already a prefix which is a sucffix . 
			// considering 0 indexed check s[len] == s[i]
			if( s[i] == s[prevlen] )
				++prevlen;

			lps[i] = prevlen;

		}

		return lps[s.length-1];
	}

	int ni() throws IOException {
		return Integer.parseInt(nextToken());
	}

	String nextToken() throws IOException {
		while( st == null || !st.hasMoreTokens() )
			st = new StringTokenizer(in.readLine());
		return st.nextToken(); 
	}

}