codeparrot/codecomplex huggingface dataset:
// Problem: 17_A. Noldbach problem
// Time complexity: linear
import java.util.*;

public class Beta17PA {

	boolean[] isPrime = new boolean[1001];
	int[] prime = new int[200];

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		new Beta17PA().solve();
	}

	public void solve() {
		Scanner scan = new Scanner(System.in);
		int n, k;
		n = scan.nextInt();
		k = scan.nextInt();
		init();
		int m = 0;
		for(int i=2; i<=n; i++) {
			if(check(i)) m ++;
		}
		if(m>=k) System.out.println("YES");
		else System.out.println("NO");
	}

	private boolean check(int n) {
		if(n<6||!isPrime[n]) return false;
		int d = n-1;
		for(int i=0; i<199&&prime[i]+prime[i+1]<=d; i++) {
			if(prime[i]+prime[i+1]==d) return true;
		}
		return false;
	}

	private void init() {
		Arrays.fill(isPrime, true);
		isPrime[0] = isPrime[1] = false;
		for(int i=2; i<1001; i++) {
			if(!isPrime[i]) continue;
			for(int j=i+i; j<1001; j+=i) {
				isPrime[j] = false;
			}
		}
		int count = 0;
		for(int i=2; i<1001; i++) {
			if(isPrime[i]) prime[count++] = i;
		}
	}
}
// Problem: 17_A. Noldbach problem
// Time complexity: linear
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class A {
    BufferedReader in;
    StringTokenizer st;
    PrintWriter out;

    void solve() throws IOException {
        int n = nextInt();
        int k = nextInt();
        boolean[] sieve = new boolean[n + 1];
        List<Integer> primes = new ArrayList<Integer>();
        for (int i = 2; i <= n; ++i) {
            if (!sieve[i]) {
                primes.add(i);
                for (int j = 2 * i; j <= n; j += i) {
                    sieve[j] = true;
                }
            }
        }
        int count = 0;
        for (int i = 0; i + 1 < primes.size(); ++i) {
            int v = primes.get(i) + primes.get(i + 1) + 1;
            if (v <= n && !sieve[v]) {
                ++count;
            }
        }
//        System.err.println(count);
        out.println(count >= k ? "YES" : "NO");
    }

    public void run() throws IOException {
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        eat("");
        solve();
        out.close();
        in.close();
    }

    void eat(String s) {
        st = new StringTokenizer(s);
    }

    String next() throws IOException {
        while (!st.hasMoreTokens()) {
            String line = in.readLine();
            if (line == null) {
                return null;
            }
            eat(line);
        }
        return st.nextToken();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }

    public static void main(String[] args) throws IOException {
        new A().run();
    }
}
// Problem: 17_A. Noldbach problem
// Time complexity: linear
import java.lang.*;
import java.io.*;
import java.util.*;
import java.math.*;

public class Solution implements Runnable{
    private static BufferedReader br = null;
    private static PrintWriter out = null;
    private static StringTokenizer stk = null;
    
    public static void main(String[] args) {
        br = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        (new Thread(new Solution())).start();
    }
    
    private void loadLine() {
        try {
            stk = new StringTokenizer(br.readLine());
        }
        catch (IOException e) {
            e.printStackTrace();
        }
    }
    
    private String nextLine() {
        try {
            return br.readLine();
        }
        catch (IOException e) {
            e.printStackTrace();
        }
        return null;
    }
    
    private Integer nextInt() {
        while (stk==null||!stk.hasMoreTokens()) loadLine();
        return Integer.parseInt(stk.nextToken());
    }
    
    private Long nextLong() {
        while (stk==null||!stk.hasMoreTokens()) loadLine();
        return Long.parseLong(stk.nextToken());
    }
    
    private String nextWord() {
        while (stk==null||!stk.hasMoreTokens()) loadLine();
        return (stk.nextToken());
    }
    
    private Double nextDouble() {
        while (stk==null||!stk.hasMoreTokens()) loadLine();
        return Double.parseDouble(stk.nextToken());
    }
    
    public void run() {
        int n = nextInt();
        int k = nextInt();
        
        boolean[] isP = new boolean[2*n];
        Arrays.fill(isP, true);
        isP[0] = isP[1] = false;
        
        for (int i = 0; i <= n; ++i) {
            if (isP[i]) {
                for (int j = i+i; j <= n; j+=i) {
                    isP[j] = false;
                }
            }
        }
        
        ArrayList<Integer> p = new ArrayList<Integer>();
        for (int i = 0; i <= n; ++i) {
            if (isP[i]) {
                p.add(i);
            }
        }
        
        int cnt = 0;
        for (int i = 0; i < p.size(); ++i) {
            int num = p.get(i) - 1;
            
            for (int j = 0; j < p.size() - 1; ++j) {
                if (p.get(j) + p.get(j+1) == num) {
                    ++cnt;
                    break;
                }
            }
        }
        
        if (cnt >= k) {
            out.println("YES");
        }
        else {
            out.println("NO");
        }
        out.flush();
    }
}
// Problem: 17_A. Noldbach problem
// Time complexity: linear
import java.io.*;
import java.math.*;
import java.util.*;

public class Primes
{
	static Scanner in = new Scanner( new BufferedReader( new InputStreamReader( System.in ) ) );

	public static void main( String[] args )
	{
		int n = in.nextInt(), k = in.nextInt(), count = 0;
		boolean[] isP = new boolean[n+1];
		for( int i = 2; i <= n; i++ ) isP[i] = true;
		ArrayList<Integer> primes = new ArrayList<Integer>();
		for( int i = 2; i <= n; i++ ) if( isP[i] )
		{
			primes.add(i);
			if( i <= Math.sqrt(n) ) for( int j = 2*i; j <= n; j += i ) isP[j] = false;
		}
		for( int i = 0; i < primes.size()-1; i++ )
		{
			int sum = primes.get(i)+primes.get(i+1)+1;
			if( sum<=n && isP[sum] ) count++;
		}
		if( count>=k ) System.out.println( "YES" );
		else System.out.println( "NO" );
	}
}
// Problem: 224_B. Array
// Time complexity: linear
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;


public class B {
	
	// -- DEBUG switch --
	static final boolean DBG = false;
	static StreamTokenizer st = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
	static PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));

	static int[] e = new int[100001];
	
	public static void main(String[] args) throws IOException {
		int n = i(), k = i(), cnt = 0;
		int[] a = new int[n+1];
		for (int i=1; i<=n; i++){
			a[i] = i();
			if (e[a[i]] == 0)
				cnt++;
			e[a[i]]++;
		}
		if (k > cnt){
			pw.println("-1 -1");
			pw.close();
			return;
		}
		if (cnt == n){
			pw.print("1 " + k);
			pw.close();
			return;
		}
		if (k == 1){
			pw.println("1 1");
			pw.close();
			return;
		}
		Arrays.fill(e, 0);
		int i = 1, j = 0, unik = 0, start = 0, end = 0, len = n, m = 0;


		if (e[a[i]] == 0){
			unik++;
		}
		e[a[i]]++;
		while (i+1<=n && a[i+1] == a[i]){
			i = i+1;
		}		
		
		j = i+1;
		
		while (j <= n){
			if (e[a[j]] == 0){
				unik++;
				if (unik == k){
					while (e[a[i]] > 1){
						e[a[i]]--;
						i++;
						while (i+1<=n && a[i+1] == a[i]){
							i = i+1;
						}	
					}
					m = j - i + 1;
					if (m < len){
						start = i; end = j; len = m;
						if (m == k)
							break;
					}
					
					while (i <=n && unik == k){
						e[a[i]]--;
						if (e[a[i]] == 0)
							unik--;
						i++;
						
						while (i+1<=n && a[i+1] == a[i]){
							i = i+1;
						}					
					}

				}
			}
			e[a[j]]++;
			while (j+1<=n && a[j+1] == a[j]){
				j++;
			}			
			j++;

		}
		pw.println(start + " " + end);	
		pw.close();
	}
	
	static int i() throws IOException{
		st.nextToken();
		return (int)st.nval;
	}
	
	static long l() throws IOException {
		st.nextToken();
		return (long)st.nval;
	}

	static double d() throws IOException {
		st.nextToken();
		return st.nval;
	}
	static String s() throws IOException{
		st.nextToken();
		return st.sval;
	}
}
// Problem: 224_B. Array
// Time complexity: linear
import java.util.Arrays;
import java.util.Scanner;

public class Array {
		
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int k = in.nextInt();
		/*
		if ( k == 1 ){ 
			System.out.println("1 1"); return;
		}
		*/
		int last[] = new int[100001];
		int distinct = 0;
		for ( int i = 0 ; i < n ; ++i ) {
			int t = in.nextInt();
			if ( last[t] == 0 ) ++distinct;
			last[t] = i+1;
			if ( distinct == k ) {
				int min = i+1;
				for ( int j = 0 ; j < last.length ; ++j ) {
					if ( last[j] != 0 ) min = min>last[j]?last[j]:min;
				}
				System.out.println(min+" "+(i+1)); return;
			}
		}
		System.out.println("-1 -1"); 
	}
	
}
// Problem: 224_B. Array
// Time complexity: linear
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;


public class C_138B {
	private static BufferedReader in;
	private static StringTokenizer st;
	private static PrintWriter out;
	
	
	static String nextToken() throws IOException {
		while (!st.hasMoreTokens()) {
			st = new StringTokenizer(in.readLine());
		}
		return st.nextToken();
	}
	
	static int nextInt() throws NumberFormatException, IOException {
		return Integer.parseInt(nextToken());
	}
	public static void main(String[] args) throws NumberFormatException, IOException {
		in = new BufferedReader(new InputStreamReader(System.in));
		st = new StringTokenizer("");
		out = new PrintWriter(new OutputStreamWriter(System.out));
		int n = nextInt();
		int k = nextInt();
		int [] a = new int [n];
		for (int i = 0; i < n; i++) {
			a[i] = nextInt();
		}
		Set<Integer> set = new HashSet<Integer>();
		for (int i = 0; i < a.length; i++) {
			set.add(a[i]);
			if(set.size()==k){
				Set<Integer> set2 = new HashSet<Integer>();
				for (int j = i; j >= 0; j--) {
					set2.add(a[j]);
					if(set2.size()==k){
						out.print((j+1)+" "+(i+1));
						out.close();
						return;
					}
				}
			}
		}
		out.print("-1 -1");		
		out.close();
	}
}
// Problem: 224_B. Array
// Time complexity: linear
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.StringTokenizer;

public class Array {

    void run() {
        try {
            BufferedReader bfd = new BufferedReader(new InputStreamReader(
                    System.in));
            StringTokenizer tk = new StringTokenizer(bfd.readLine());
            int n = Integer.parseInt(tk.nextToken());
            int k = Integer.parseInt(tk.nextToken()), i;
            int arr[] = new int[n];
            tk = new StringTokenizer(bfd.readLine());
            for(i=0;i<n;++i)
                arr[i] = Integer.parseInt(tk.nextToken());
            int dist=0,l=0,r=0;
            HashSet<Integer> hs = new HashSet<Integer>();
            for(i=0; i<n; ++i) {
                if(!hs.contains(arr[i])){
                    hs.add(arr[i]);
                    dist++;
                }
                if(dist==k) break;
                r++;
            }
            int freq[] = new int[100010];
            if(hs.size()<k) System.out.println("-1 -1");
            else {
                while(l<arr.length-1 && l<r && arr[l]==arr[l+1])
                    ++l;
                while(r>=1 && r>l && arr[r]==arr[r-1])
                    --r;
                for(i=l;i<=r;++i)
                    freq[arr[i]]++;
                while(freq[arr[l]]>1){
                    freq[arr[l]]--;
                    l++;
                }
                while(freq[arr[r]]>1){
                    freq[arr[r]]--;
                    r--;
                }
                System.out.println((l+1)+" " +(r+1));
            }
        } catch (Exception e) {

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

}
// Problem: 224_B. Array
// Time complexity: linear
import java.io.*;
import java.util.*;

public class B implements Runnable {

	void Solution() throws IOException {
		int n = nextInt(), k = nextInt();
		int[] mas = new int[n];
		for (int i = 0; i < n; i++)
			mas[i] = nextInt();
		int l = 0, r = 0;
		HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
		map.put(mas[l], 1);
		int cur = 1;
		while (true) {
			if (cur == k) {
				print(l + 1, r + 1);
				return;
			}
			r++;
			if (r >= n)
				break;
			int kol = map.containsKey(mas[r]) ? map.remove(mas[r]) : 0;
			if (kol == 0) {
				cur++;
				map.put(mas[r], 1);
			} else
				map.put(mas[r], kol + 1);
			while (true) {
				kol = map.remove(mas[l]);
				if (kol == 1) {
					map.put(mas[l], 1);
					break;
				} else
					map.put(mas[l++], kol - 1);
			}
		}
		print(-1, -1);
	}

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

	BufferedReader in;
	PrintWriter out;
	StringTokenizer tokenizer;

	public void run() {
		try {
			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);
			Solution();
			out.close();
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(0);
		}
	}

	void print(Object... obj) {
		for (int i = 0; i < obj.length; i++) {
			if (i != 0)
				out.print(" ");
			out.print(obj[i]);
		}
	}

	void println(Object... obj) {
		print(obj);
		out.println();
	}

	void halt() {
		out.close();
		System.exit(0);
	}

	String nextLine() throws IOException {
		return in.readLine();
	}

	String next() throws IOException {
		while (tokenizer == null || !tokenizer.hasMoreTokens())
			tokenizer = new StringTokenizer(nextLine());
		return tokenizer.nextToken();
	}

	int nextInt() throws NumberFormatException, IOException {
		return Integer.parseInt(next());
	}

	long nextLong() throws NumberFormatException, IOException {
		return Long.parseLong(next());
	}

	double nextDouble() throws NumberFormatException, IOException {
		return Double.parseDouble(next());
	}
}
// Problem: 224_B. Array
// Time complexity: linear
import java.io.*;
import java.util.*;
public class B {
	static int i(String s) { return Integer.parseInt(s); }
	public static void main(String[] args) throws Exception {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		String[] arr = in.readLine().split(" ");
		int n = i(arr[0]);
		int k = i(arr[1]);
		int[] A = new int[n];
		arr = in.readLine().split(" ");
		for(int i=0; i<n; i++)
			A[i] = i(arr[i]);
		
		int st = 0;
		int cnt = 0;
		int[] cnts = new int[100*100*10+1];
		for(int i=0; i<n; i++) {
			cnts[A[i]]++;
			if(cnts[A[i]] == 1) cnt++;
			else while(cnts[A[st]] > 1) {
				cnts[A[st]]--;
				st++;
			}
			if(cnt == k) {
				System.out.println((st+1)+" "+(i+1));
				return;
			}
		}
		System.out.println(-1+" "+-1);
	}
}
// Problem: 224_B. Array
// Time complexity: linear
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class B {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int distinct = sc.nextInt();
        HashMap<Integer, Integer> set = new HashMap<Integer, Integer>();
        int[] ar = new int[n];
        for (int i = 0; i < n; i++) {
            ar[i] = sc.nextInt();
            if (set.containsKey(ar[i])) {
                set.put(ar[i], set.get(ar[i])+1);
            } else {
                set.put(ar[i], 1);
            }
            if (set.size() == distinct) {
                int st = 0;
                for (int j = 0; j < i; j++) {
                    st=j;
                    if (set.get(ar[j]) > 1) {
                        set.put(ar[j], set.get(ar[j]) - 1);
                    } else {
                        break;
                    }
                }
                System.out.println((st + 1) + " " + (i + 1));
                return;
            }
        }
        System.out.println("-1 -1");
    }
}
// Problem: 224_B. Array
// Time complexity: linear
import java.util.Scanner;


public class B {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner scr = new Scanner(System.in);
		int n = scr.nextInt();
		int k = scr.nextInt();
		
		int[] a = new int[n+1];		
		int[] d = new int[100001];
		
		int tk = 0;
		int l = 1;
		int r = -1;
		boolean find = false;
		for (int i = 1; i <= n; i++){
			a[i] = scr.nextInt();
			if (d[a[i]] == 0){
				d[a[i]] = 1;
				tk++;
				if ((!find) && (tk == k)){
					find = true;
					r = i;
				} // if 
			} // if
		} // for
		
		
		if (r > 0) {
			int[] cd = new int[100001];
			tk = 0;
			find = false;
			for (int j = r; j >= l; j--){
				if(cd[a[j]] == 0){
					cd[a[j]] = 1;
					tk++;
					if ((!find) && (tk == k)){
						find = true;
						l = j;
						break;
					} // if
				} // if
			} // for
			System.out.println(l + " " + r);
		} // if
		else {
			System.out.println("-1 -1");
		}			

	}

}
// Problem: 224_B. Array
// Time complexity: linear
import java.util.*;
import java.io.*;
public class B {
	public void solve() throws IOException {
		int n = nextInt();
		int k = nextInt();
		int[] a = new int[n];
		for(int i = 0; i < n; i++){
			a[i] = nextInt();
		}
		int[] num = new int[n];
		Set<Integer> set = new HashSet<Integer>();
		int s = -1;
		int l = -1;
		for(int i = 0; i < n; i++){
			set.add(a[i]);
			num[i] = set.size();
			if( num[i] == k ){
				l = i+1;
				set = new HashSet<Integer>();
				for(int j = i; j >= 0; j--){
					set.add(a[j]);
					if( set.size() == k ){
						s = j+1;
						break;
					}
				}
				break;
			}
		}
		writer.println(s + " " + l);
 	}

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

	BufferedReader reader;
	StringTokenizer tokenizer;
	PrintWriter writer;

	public void run() throws IOException {
		try {
			reader = new BufferedReader(new InputStreamReader(System.in));
			tokenizer = null;
			writer = new PrintWriter(System.out);
			solve();
			reader.close();
			writer.close();
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(1);
		}
	}

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

	public double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}

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

}
// Problem: 224_B. Array
// Time complexity: linear
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class PrB {

	public static long time;
	
	public static void main(String[] args) throws Exception {
		time = System.currentTimeMillis();
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		n = Integer.parseInt(st.nextToken());
		k = Integer.parseInt(st.nextToken());
		a = new int[n];
		st = new StringTokenizer(br.readLine());
		for(int i = 0; i < n; i++) 
			a[i] = Integer.parseInt(st.nextToken());
		int end = end();
		if(end < 0) System.out.println("-1 -1");
		else System.out.println((start(end) + 1) + " " + (end + 1));
		br.close();
		System.exit(0);
	}
	
	static int n, k;
	static int[] a;

	public static int end() throws Exception {
		boolean[] reached = new boolean[100002];
		int rem = k;
		for(int i = 0; i < n; i++) {
			if(!reached[a[i]]) {
				rem--;
				if(rem == 0) return i;
			}
			reached[a[i]] = true;
		}
		return -1;
	}
	
	public static int start(int end) throws Exception {
		boolean[] reached = new boolean[100002];
		int rem = k;
		for(int i = end; i >= 0; i--) {
			if(!reached[a[i]]) {
				rem--;
				if(rem == 0) return i;
			}
			reached[a[i]] = true;
		}
		return 0;
	}

	public static void checkTime() {
		System.out.println(System.currentTimeMillis() - time);
		time = System.currentTimeMillis();
	}
}
// Problem: 224_B. Array
// Time complexity: linear


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;

public class B {

    static BufferedReader in;
    static StringTokenizer st;

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

    static int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    public static void main(String[] args) throws IOException {
        in = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
        int n = nextInt();
        int k = nextInt();
        int[] a = new int[n + 1];
        for (int i = 1; i <= n; i++) {
            a[i] = nextInt();
        }
        Set<Integer> set_1 = new HashSet<Integer>();
        for (int i = 1; i <= n; i++) {
            set_1.add(a[i]);
            if (set_1.size() == k) {
                Set<Integer> set_2 = new HashSet<Integer>();
                for (int j = i; j >= 1; j--) {
                    set_2.add(a[j]);
                    if (set_2.size() == k) {
                        out.print(j + " " + i);
                        out.close();
                        return;
                    }
                }
            }
        }
        out.print("-1 -1");
        out.close();

    }
}
// Problem: 224_B. Array
// Time complexity: linear
import java.io.*;
import java.util.*;


public class B {
    public static void main(String[] args) throws Exception {
        new B().solve();
    }
    
    void solve() throws IOException {
        BufferedReader in = new BufferedReader(new
                InputStreamReader(System.in));
        // Scanner sc = new Scanner(System.in);
        
        String[] sp = in.readLine().split(" ");
        
        int n = Integer.parseInt(sp[0]);
        int k = Integer.parseInt(sp[1]);
        int[] a = new int[n];
        sp = in.readLine().split(" ");
        for (int i = 0; i < n; i++) {
            a[i] = Integer.parseInt(sp[i]);
        }
        
        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
        int r = 0;
        map.put(a[r], 1);
        while (map.size() < k) {
            r++;
            if (r == n) {
                // ng
                System.out.println("-1 -1");
                return;
            }
            if (map.containsKey(a[r])) {
                map.put(a[r], map.get(a[r]) + 1);
            } else {
                map.put(a[r], 1);
            }
        }
        int l = 0;
        while (map.get(a[l]) > 1) {
            map.put(a[l], map.get(a[l]) - 1);
            l++;
        }
        System.out.println((l + 1) + " " + (r + 1));
    }
}




//