/*********************************************
* 20.05.15 AtCoder Beginner Contest 155.
* 
*
*********************************************/
/*********************************************
::test input::
*********************************************/

namespace TempName{
    using System;
    using System.Linq;
    using System.Collections.Generic;
    using System.Reflection;
    using static System.Console;
    using static IOmacro.CSharpInput; 
    using static IOmacro.CppInput;
    using static IOmacro.CConst;

    public class CRun{
        public readonly char problem_num = 'D';
        
        public void solve_1() {
            // A - Poor 
            // 3개의 수 중에서 2개가 같고, 나머지가 다른 경우
            
            int a = cin, b = cin, c = cin;
            string ans = "No";
            
            if (a == b) if (a != c) ans = "Yes";
            if (a == c) if (a != b) ans = "Yes";
            if (b == c) if (a != b) ans = "Yes";
            
            WriteLine(ans);
            
        }

        public void solve_2() {
            // B - Papers, Please 
            // 조건 판단
            // 정수 집합 중, 짝수인 것은 모두 3 또는 5로 나눠떨어진다.
            
            int qry_num = _int;
            int[] list = _inta;
            
            string ans = "APPROVED";
            
            for(int i = 0; i < qry_num; i++) {
                if ((list[i] & 1) == 0) {
                    if (list[i] % 3 == 0 || list[i] % 5 == 0) {
                        continue;
                    }
                    else {
                        ans = "DENIED";
                        break;
                    }
                }
            }
            
            WriteLine(ans);
        }

        public void solve_3() {
            // C - Poll 
            // N개의 투표용지, 각각 Si 문자열
            // 쓰여진 횟수가 가장 많은 문자열 출력
            // 복수인 경우 사전순
            
            int qry_num = _int;
            var dict = new Dictionary<string, int>();
            int ans_max = 0;
            for (int i = 0; i < qry_num; i++) {
                var input = _string;
                if (dict.ContainsKey(input)) {
                    dict[input] += 1;
                }
                else {
                    dict[input] = 1;
                }
                ans_max = Math.Max(ans_max, dict[input]);
            }
            
            var ans = new List<String>();
            foreach (var ix in dict) {
                if (ix.Value == ans_max) {
                    ans.Add(ix.Key);
                }
            }
            ans.Sort(StringComparer.Ordinal);
            foreach (var ix in ans) _writer.WriteLine(ix);
            _writer.Close();
        }
        
        public void solve_4() {
            // D - Pairs 
            // N개의 수 Ai
            // 2개를 골라서 곱을 했을 때, K번째 작은 수는?
            // N = 2*10^5
            
            long N = cin;
            long K = cin;
            long[] A = _longa;
            Array.Sort(A, (x,y) => (int)(x - y));
            
            
            Func<long, long> calc = (x) => {
                
                long ret = 0;
                
                for (long i = 0; i < N - 1; i++) {
                    
                    long now = A[i];
                    //WriteLine($"{i} {N} {ret} {now} {x} ");
                    if (now == 0) {
                        if (x >= 0) {
                            ret += N - 1 - i;
                        }
                    }
                    else if (now > 0) {
                        long l = i + 1;
                        long r = N;
                        if (now * A[l] > x) continue;
                        while (l + 1 < r) {
                            long m = (l + r)>>1;
                            if (now * A[m] <= x) {
                                l = m;
                            }
                            else {
                                r = m;
                            }
                        }
                        ret += l - i;
                    }
                    else if (now < 0) {
                        long l = i + 1;
                        long r = N;
                        if (now * A[l] <= x) {
                            ret += N - 1 - i;
                            continue;
                        }
                        while (l + 1 < r) {
                            long m = (l + r)>>1;
                            if (now * A[m] > x) {
                                l = m;
                            }
                            else {
                                r = m;
                            }
                        }
                        ret += N - r;
                    }
                    
                }
                return ret;
            };
            
            {
                long l = (long)-1e18 - 5;
                long r = -l;
                while (l + 1 < r) {
                    long m = (l + r)>>1;
                    long cnt_less = calc(m);
                    if (cnt_less < K) {
                        l = m;
                    }
                    else {
                        r = m;
                    }
                    //WriteLine($"{cnt_less} {m}");
                }
                
                WriteLine(r);
                
            }
            
        }
        
        public void solve_5() {
            
        }
        
        public void solve_6() {
            
        }
    }
    
    class Program { 
        static void Main() { 
            var run = new CRun();
            if (run.problem_num == 'A') run.solve_1(); 
            if (run.problem_num == 'B') run.solve_2(); 
            if (run.problem_num == 'C') run.solve_3();
            if (run.problem_num == 'D') run.solve_4();
            if (run.problem_num == 'E') run.solve_5();
            if (run.problem_num == 'F') run.solve_6();
        } 
    }
}

namespace IOmacro {
    //20.05.10. 수정
    
    using System; 
    using System.Linq; 
    using System.IO;
    using System.Collections.Generic;
    
    public class CSharpInput {
        public static StreamWriter _writer = new StreamWriter(Console.OpenStandardOutput());
        public const char separator = ' ';
        public static string _string{get{return Console.ReadLine();}}
        public static string[] _stringa{get{return (Console.ReadLine().Split(separator));}}
        public static int _int{get{return int.Parse(Console.ReadLine());}}
        public static int[] _inta{get{return Console.ReadLine().Split(separator).Select(int.Parse).ToArray();}}
        public static long _long{get{return long.Parse(Console.ReadLine());}}
        public static long[] _longa{get{return Console.ReadLine().Split(separator).Select(long.Parse).ToArray();}}    
        public static double _double{get{return double.Parse(Console.ReadLine());}}
        public static double[] _doublea{get{return Console.ReadLine().Split(separator).Select(double.Parse).ToArray();}}    
    }
    
    public class CConst {
        public static readonly int MINI = int.MaxValue;
        public static readonly long INF = Int64.MaxValue;
    }
    
    public class CppInput {
        public static CppInput cin => new CppInput();
        public const char separator = ' ';
        private static readonly Queue<string> _input = new Queue<string>();
        private CppInput(){}
        public static implicit operator string(CppInput _) {
            if (_input.Count == 0) Console.ReadLine().Split(separator).foreachExtension(x => _input.Enqueue(x));
            return _input.Dequeue();
        }
        public static implicit operator int(CppInput _){
            if (_input.Count == 0) Console.ReadLine().Split(separator).foreachExtension(x => _input.Enqueue(x));
            return int.Parse(_input.Dequeue());
        }
        public static implicit operator long(CppInput _){
            if (_input.Count == 0) Console.ReadLine().Split(separator).foreachExtension(x => _input.Enqueue(x));
            return long.Parse(_input.Dequeue());
        }
        public static implicit operator double(CppInput _){
            if (_input.Count == 0) Console.ReadLine().Split(separator).foreachExtension(x => _input.Enqueue(x));
            return double.Parse(_input.Dequeue());
        }
    }
    
    public static class EnumerableExtension {
        public delegate void Function<in T>(T val);
        public static void foreachExtension<T>(this IEnumerable<T> enumerable, Function<T> function) {
            foreach (var x in enumerable) function(x);
        }
    }
}



Measured memory_bytes: 39116