/* Kth Element Find
 *
 * Given two sorted lists of size m and n, Give an O(logm + logn) time
 * algorithm for computing the kth smallest element in the union of the
 * two lists
 *
 * You should use a single implementation which should run on any type
 * that implements <, >, <=, >=, !=, and ==
 *
 * For your testing purposes, iostream has been included
 * If there's any questions about the skeleton file, email us
 *
 */

using namespace std;
#include <iostream>



/* Find the kth smallest element out of the union of lst1 and lst2
 */
template <typename Comparable>

Comparable kElementFind(Comparable lst1[], Comparable lst2[], int k, size_t len1, size_t len2) {
	/* YOUR CODE HERE
	 * Return the element
	 */

}


int main() {
}